Why is the code not working correct for all the test cases

#1

DEEPAK AND PRIMES

#2

hello @jsn853
increase ur sieve size.
value of n is 5000 000 . so ur sieve size must be greater than the value of 5000 000 th prime number.

check value of 5000 000 th prime number. and make changes accordingly.

#3

refer this code -> https://ide.codingblocks.com/s/233373

#4

still it not working

#5

no it should work.
pls share ur updated code. it will check

#6


pls have a look at the output as it is showing time limit exceeded which was the problem before also

#7

@jsn853
pls try after sometime ,right now checker is giving wrong results for every solutions

#8

Still not working…

#9

see there is nothing wrong in the solution. some issue is there with the checker.
it will resolve soon.

#10

It is not even working on the sublime editor

#11

Please reply , I am waiting.

#12

please reply as soon as you can …

#13

try this.
the code i shared before is also correct but because they have changed memory constraint it is showing error.

1 Like
#14

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.

#15

bro do u still have any doubt?