OJ Board

sohel, thank u very much, u enlightened me:)

I use bisearch to find the first one in a1-an
which larger than an/2, supposing it's ai
which larger than an/3, supposing it's aj
which larger than an/5, supposing it's ak

then an+1 is min{2*ai, 3*aj, 5*ak}

Recently, I met an interesting problem, I don't know whether VOJ has a similar problem.

V = 2^i * 3^j * 5^k
i, j, k all belong to natural number, i.e. , 0, 1, 2...
so, V can be 1, 2, 3, 4, 5, 6, 8, 9, 10,..... in ascending order.
Input is n, which represents the order number of V
Output is the ...

I totally agree, this new one is far uneasier than the old one!

I want 2 see the whole ranklist of the problem I got ac with,
not only the top 20.

I remembered the old system could, but how about the new one?

Thanks!

mf wrote:Probably because you forgot to return 0 from main(). Non-zero exit code is treated as a runtime error now (as it should be).

THANks A LOT, mf!
I GOT AC & Rank 31:)

I also got RTE, but on POJ, I got AC.

http://acm.pku.edu.cn/JudgeOnline/problemlist

This is my code. Can anybody tell me why RTE on VOJ. Thanks A LOT！