OJ Board

How can I get all the codes that I have submitted to OJ. Please help me by informing the procedure in details.
Thanks in advance

How can I implement sieve within 0.2 or 0.1 second. My implementation
takes almost 2 seconds. Please help & give a complete description.

i dont know why my prog gets WA . all the inputs of this forum works perfectly . can anyone find some stupid inputs and help me . i am really
fade up with this problem .

How can I precalculate it . I have used string manipulation( big int ) but it takes too much time. The data I think should require big int . Is there any big int implementation that takes less time. or is there any built in data type that can be used.

I think , I got the right recursive equation. But I dont know how to calculate it . It needs the big int calculation and how can I do this in less time . Please help me if you can.

thanks in advance .

Can anyone help me solving this problem. I used the following formula
ans = sum of ( pi*|xi|) for all i / sum of pi for all i where xi is positive.

I suppose this formula is correct . If it is then is there any special input
that can make this ans wrong.

thanks in advance.