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|
can't get it to work on ideaone either, getting timeout error here but works fine locally.
showing time out
finally did it, took me 3 days to solve... :P
working fine with codeblocks within time limit.
Sample correct in ideone, Python.
the same problem is happening with me
working fine on ideone and codechef ide. shows runtime error on submission. any ideas?
I am getting timeout...
getting SIGSEGV error. My code is working fine on Ideone. What should I do?
what size should we choose for arrays?