OJ Board

Adrian, I see you solution to this problem is the fastest. Did you use the approach of simulating over the LCM of the periods? I can't make it to run in the time limit.
Thanks.

Well, I managed to solve it after all... The problem was that the number of tests was different then it should have been... I got AC when I read until I got EOF

I tried to solve the problem from http://acmicpc-live-archive.uva.es/nuevoportal/data/problem.php?p=2755
I got WA, even though I got Accepted on another on-line judge (with exactly the same source), and I got 100 points at a romanian contest in which it was a similar problem (I tested it with the ...

instead of keeping a huge array for those numbers, try storing them in a balanced binary search tree (you can use map in C++) there are only about 700000 of them or so... then do a binary search when computing the result

A link to this problem: http://acmicpc-live-archive.uva.es/nuevoportal/data/problem.php?p=3032

I managed to build a O(N^2) time and O(N) space algorithm using dynamic programming, but I still get time limit exceeded...
Please reply to this message if you have a better ideea. (I suspect a greedy ...