COJ Forum

Today we will host "The 1st Progressive Contest" http://coj.uci.cu/contest/contestview.xhtml?cid=1125 Please, any bug that you find during the execution of the contest, write it in this thread to fix it promptly. We hope that you enjoy it very much!!! Thank you and have fun! COJ Development Team (CD...

Sometimes the use of recursion in version 1.0 get an incorrect result by the jury. Specifically when the number of recursive calls is considerably large (LCA+EULER_TOUR, DFS with several (millions) calls, for example). This bug has been fixed, and the affected problems (list below) have new judgment...

There is, of course, a more optimal solution... otherwise you had ACC already ...
You have to work a little more looking at the problem
Best Regards.

Well, maybe if I explain a little the statement ... is already very easy to solve ... This is the idea: - A circle of hassocks, with a flea in the first hassocks (can be anything but note that the starting point is indifferent to the solution) - After minute number 1 the flea jumps through 0 hassoсk...

Well, maybe the best thing is to link a document that clearly defines which are the valid moves. I will do this later. Anyway, no one has solved the problem yet. It may be appropriate to review (for safety) data sets.

ypozo wrote:Also add that the source of this problem is http://acm.timus.ru/problem.aspx?space=1&num=1099 on Timus Online Judge,
salu-DDoS for all

Done...
Thank you.

The input file is really huge, more than 30 MB, The reading may be is the problem with RTE for Java. I am not sure about that, our development team will look about this problem shortly.

In this Site > http://livearchive.onlinejudge.org/ You can find the official problems from past ACM-ICPC world competitions. In the Forum > http://acmicpc-live-archive.uva.es/archiveboard/ Some discussions about the problems of past World Finals. Also, I let you this comments by Petr Mitrichev about...