Wa IN PRIME1

[Ekta_sof]

i m doing the prime generator problem ( spoj.com/problems/PRIME1)on spoj. But its giving wrong answer..
Please ..Please help!!

Here is the solution..

ideone.com/JChlV3

[luckymastermin]

You need to print one blank line after each test case

[Ekta_sof]

ideone.com/JChlV3

Still giving wrong answer!!

[leppyr64]

Your code outputs far too much. You have tested your code very much.

[Ekta_sof]

Can you please suggest the correction from where to start debugging it cuz i am really confused for how it should be done.

[leppyr64]

When testing, you should always test all possibilities in a conditional. For example if you have an if/else you should test the solution where the of returns true and if the if returns false. You have a couple of those in your main.

I'm trying to guide your thought process. If you have questions, please post back.

[Ekta_sof]

I am basically testing the if condition for three cases: when n<=100000(m will obviously be less than n) - for this the normal sieve will work.
In case m<=100000 but n is greater than this value - it goes to else part of if (line no 61) and the rest of the code will be executed till n.
In case both are greater than 100000, line 61 will be skipped.

Am i doing some mistake in segmented concept of sieve? Because I now think that may be the reason.
Can you please provide some test cases that may help.

Thanks!!

[leppyr64]

By "testing" I actually mean attempting to run your code with a test case that verifies that those conditions actually perform as expected.

I will leave you to come up with the actual test cases. This is something very important to learn. You're on the right track.