OJ Board

I need some test case. I'm getting WA.

I think some peopel get WA because of circle intersection/overlaping. Two circle will overlap if :-

** Distance between two center is less or equal (<=) sum of two radius and grater or equal (>=) abs_diff(radius1-radius2)

In case of float/double data type using = is not good idea. Rather use fabs ...

Hi there,
Some of your given input is not valid. The maximum possible value of moves can be 2^n-1. But you have > 2^n-1 in case of following data:

36 23478162346434234
67 2349302402348238482342348
88 747328293948729334241100234

Output is correct without these inputs.

Here is some test cases:

Input:

100 4
2 3 5 7
20 2
4 6
100 6
2 5 8 30 101 7
2100000000 10
12345 54123 23425 20000 12312 22222 1234 2021 111111 12344321
2147483647 3
2147483647 2 128


Output:

22
13
34
2096573927
1073741823


If the above test cases are not enough, you can make your own ...

I'm not a pascal progrqammer. Try to shear ideas rather sending codes.
Most people prefer C/C++

But I think you check 1e-6 for precision error.
I got accepted using 1e-10 for prcision error. :D
Also becareful with the inputs. Coordinates can be in floating point num:
It may help you...

A tip if ...

It is a very beautiful problem. You have to be careful about problem statements all the time.

INPUT:

2

100 5
1 1
2 2
3 3
4 1
5 2
6 3

0 0

Output:

4

0

Hope it will help you. Good luck

Try this:

INPUT:

4
4
10 15 50 30
0 3 4 3
40 20 1

OUTPUT:

240, 0, 0, 0
Number of fish expected: 480

I check your code and it seems everything ok but it can not handle the input like following. Fix it and it may give you Accepted. :lol:

INPUT:

0


Your output is:

Day #1: the longest nap starts at 0:00 and will last for 18 hours and 0 minutes.


Output should be:

Day #1: the longest nap ...

Here is some input/output for you.

INPUT:

4
13:00 15:00 Boring lectures...
15:30 17:45 Reading
10:00 12:00 Lectures
12:00 13:00 Lunch, like always.
4
10:00 12:00 Lectures
13:00 15:00 Lectures, lectures... oh, no!
16:45 17:45 Reading (to be or not to be?)
12:00 13:00 Lunch, just lunch.
4
12:00 13 ...

But my AC code give the output for the last case...

POINT 0.00 0.00

I think there is no input like this...

Mathematical problem like this, is not so easy. This problem is easy but not most easy. They are talking about most easy problems for new solvers.

I got AC in this problem. But I don't think for a space Judge may reply a WA.

But if more then one output is in same line it may give you WA.

For example:

output1 (space) output2

And if there is any extra space at the end of any output it will give you P.E

For example:

output1 (space)
output2 ...

Very less number of people use pascal . So better to post your algorithm or discuss where you face some problem.

Discussion is better than debuging. People have no much time to find the bug in your code...

Thank you very much SilentStrike. You post a beautiful sample input. It help me a lot to find the bug in my code.

Before testing with this input I was fool enought to find the bug...
It was just a simple mistake. I think most people are doing the same mistake as I do.

Finally I get AC .

I can't believe myself . . . :o :o :o

I get WA with;

remaintime=ceil(remainbyte/(transferbyte/5.0));
printf(" Time remaining: %ld seconds\n",long(remaintime));


I get AC with;

remaintime=remainbyte/(transferbyte/5.0);
printf(" Time remaining: %ld seconds\n",long(ceil(remaintime)));


only ...