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.
Do remember: 1 is NOT a prime number.
seyyed mohammad razavi:
yes!!!you must divide numbers to 2 part:(1) befor 1000000 (2)after 1000000Last edit: 2009-04-11 16:33:00
Please make sure that your algorithm is fast enough to handle input cases like 999900000 1000000000.