OJ Board

i think you should be careful about read and eof . example in this case after the last read there is still a newline char in the input, and eof will still return false, but the next read will raise an exception (that will cause runtime error if not caught) btw i'am not using pascal, but it's not rea...

the input reading has an error. after the last 'c'/'q' line you read into the next input block because scanf("\n") reads more newline chars (and the next "scanf("%d\n",&n);" will fail). i used (instead of the two scanf("%c ...) [cpp]char s[256]; while (gets(s) ...

sorry i can't help in this. i used kinda bruteforce (there are not too many states on a given board)

nope, (0.0 0.0 2.0) touches only (3.0. 2.0 2.0). (the rings have a hole inside, so only the perimeter counts)
i used '0 rings'

please next time read the previous topics about the problem you are asking! you may found the answer there.

when taking the sum of two numbers, their difference should be positive, i. e. means >0. example 26 = 7+19 (not 13+13)

the problem is not in cycle() (cycle(55)==113 is good). you repeat the last test case, use "while (cin >> i >> j)" instead. btw don't worry about integer overflow in cycle() the problem description states it won't happen.

char type has a -128..127 value range. you only deal with carry at the end, so it may happen that e[x] has value range overflow earlier (like in the example: 15*9=135 > 127)

i think only negative non integer numbers cause a difference. so (int)sqrt(value) and (int)floor(sqrt(value)) shouldn't ever be different (in valid range). integer casting only cuts the decimals: (int)-1.5=-1, but floor returns the largest integer that is less than or equal to the value: (int)floor(...

this problem is very similar to P195. i think they ment "Note that the...", but it doesn't really matter because in the judge's input there is no upper case letter.
( i used this short program: while ((ch=getchar())!=EOF) if (tolower(ch)!=ch) abort(); )

i get:

1.7750895846 0.1154579521 0.2394762157
3.5682482323 0.0842953628 0.1205519957
2.3783828932 0.1422255342 0.3610147806

(i didn't go after why is the difference and which one is actually correct, but i got accepted)

from the problem desc:
"the graph will be strongly connected. That is, there will be at least one path from any node to any other node."

zyzyis: it's probably too late, but you clear re[] array with Init() at every test case. btw why are you saving the result in re[]? why not print it right away? henar2: you can fill the graph (starting from any node, coloring to color1), fill all neighbours to the other color (recursivly). during fi...

what if trinity's path is not shorter? she may still escape (first example below). this algorithm takes only a little closer to the solution (when you can escape for sure, because you are closer to a phone as any agent), but how do you solve the problem in all other cases? (how do you know if you ar...

you have to find another path which length is not minimum (but second smallest length)

it gets compiled to me (and wrong answer). you should compare the source with the "program received" email you got from the judge. maybe your mailer is messing up something in the source.