Prateek loves candey


working for all cases except test case 0

line number 6,

for(ll i=3;i<=100000;i=i+2)

make it

for(ll i=3;i<=1000000;i=i+2)//one extra zero and then let me know if it passes or not

not working…

after calling sieve, save all prime numbers in a vector/array say prime and print for each testcase in O(1) by using cout<<prime[k-1]
Take this code for reference

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.