Prateek bhaiya loves candy

#1

So instead of calculating sieve array again and again for each test case , i calculated sieve array one at the start of main
but i am getting segmentation fault and it doesnt show up when i replace j+=2 with j++

#2

@nischay1111 i have seen your code , you have used int data type for ‘i’& ‘j’
and you are performing j*j operation which will overflow for int data type,
so try using long or long long
for refernce see this code

#3

hey aman i tried to run your code
but getting this

cb aman
cb aman720×470 15.3 KB

Also when i tried to run the original code i sent tou with replacing int by long long
i failed 1 test case

cb nischay
cb nischay742×472 15 KB


here is the link

#4

Actually it is long long try that. I just saw that long has a range similar to int.

#5

I tried
also made all variable including count long long

cb prateek
cb prateek1231×646 34.4 KB

#6

Let me try again. Ill tell you as soon as i do

#7

@nischay1111 https://ide.codingblocks.com/s/227071
try this
in question x-th prime number is asked where 1<=x<=10^6,so size of array wiil be upto the 10^6th prime number

#8

Thanks a lot for help !!
so i guess that the issue was of optimization
instead of running loop for each test case , we calculated array of prime numbers once and used it for all cases

#9

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.