Prime Sieve Not getting any output?

#1

Why I m not getting any o/p ?

#2

@namandubey20
how can you find nth prime number if you construct your sieve till n. let say n=4 if you construct
sieve till arr[4+1], you only get arr[2],arr[3] as prime number. You can never get 4th prime number in that case. So construct sieve till 10^7 in the beginning than start count.

#3

Thanks I will make the changes.

#4

mark it as resolved if you don’t have any other doubt. Thanks

#5


Why I m getting RE now ?

#6

I cann’t see any change in above code. Please create new file and save your updated code there and then share link

#7


Getting RE for n=1 also

#8

there are few mistakes in your code. fix them
1)line no 14 for(int i=3;i<10001;i+=2) run loop till 10001
2) change line 44 to { cout<<i<<endl; break; }

#9


Done, still getting RE

#10

@namandubey20
line 24 change it to cout<<i<<endl; break;

Also to pass all testcases, construct sieve till 9*10^7

#11


Still getting Run Error(Segmentation Fault) even at small test cases like n=2,3 etc.

#12

@namandubey20
I had made few changes in your code. Please check here. It works now.

#13

It’s still giving Run Error Segmentation Fault.

#14

Awaiting your reply. It’s showing run error on both cb ide as well as code blocks.

#15

@namandubey20
It is passing all testcase when i submitted the same code. Please submit it directly. It might give segmentation fault on cb ide due to limitation of memeory

#16

Yes it’s submitting but why it’s giving Fault on codeblocks installed on my computer as well ?

#17

@namandubey20
Actually there is limitation of memory in our system that’s why we can’t create array with that much large size. But at online judge, problem setter can increase the memory limit according to question. That’s why it is submitting successfully here.

#18

ok Thanks :slightly_smiling_face:

#19

@namandubey20
please mark this doubt as resolved.

#20

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.