PRIME1 - Prime Generator
Peter wants to generate some prime numbers for his cryptosystem. Help him! Your task is to generate all prime numbers between two given numbers!
The input begins with the number t of test cases in a single line (t<=10). In each of the next t lines there are two numbers m and n (1 <= m <= n <= 1000000000, n-m<=100000) separated by a space.
For every test case print all prime numbers p such that m <= p <= n, one number per line, test cases separated by an empty line.
Input: 2 1 10 3 5 Output: 2 3 5 7 3 5Warning: large Input/Output data, be careful with certain languages (though most should be OK if the algorithm is well designed)
InformationAfter cluster change, please consider PRINT as a more challenging problem.
|Added by:||Adam Dzedzej|
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Languages:||All except: NODEJS PERL 6 SCM chicken|
I don't understand why my submition doen't pass spoj's test.
0.24 sec.Last edit: 2015-03-28 12:41:49
OMG, this is tough...Last edit: 2015-03-26 06:59:00
Well, even though the algorithm takes less than .6s on a modest low power notebook, it seems to take more than 6 seconds to complete at the judge. I will be skipping it as there seems to be some problem with the judge.
first time to submit, it's accepted! :)
No need to implement the sieve algorithm. After 6 WA, changed a bit in the basic approach (optimized it) and got it ACCEPTED . If you need any help mail me at email@example.com. Language used : C++.
my program for prime generator works fine but i am facing time limit exceeded problem. i have tested my program on ideone.com but when i try it spoj.com it says time limit exceeded. can anybody help me ??
till now it is passing without sieve so pls reduce the time limit
I give up, I'll go ask around somewhere else. I'm not getting the activation email at all.Last edit: 2015-03-09 03:57:02
Finally in 0.01 time :-)