How this code went for AC where the sieve function running for n=1e7 ?
Can’t understand.Please help.Thanks in advance ![]()
How this code went for AC where the sieve function running for n=1e7 ?
Can’t understand.Please help.Thanks in advance ![]()
In Codechef, 1 secs is normally around 3∗10^8.
Refer to the last line in the last paragraph of Time Complexity in this link
Is it also works in real onsite contests ?
Can’t comment on this. It should depend on the configuration of the judge machine.
Thanks a lot 
You are welcome.