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!
Input
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.
Output
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.
Example
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)
Information
After cluster change, please consider PRINT as a more challenging problem.hide comments
|
milosrs:
2016-04-08 17:32:37
Guys, how can I see where I get the wrong answer, runtime errors etc? |
|
x_codecreative:
2016-04-08 07:07:25
the read file .txt fuction in sample code ,available or not? |
|
subh_8899:
2016-04-07 21:33:39
TLE ..i don't know why.
|
|
satyabrat1:
2016-04-07 06:31:08
AKS Primality test ... deterministic algorithm |
|
Ganesh Manickam:
2016-04-05 08:17:50
time limit exceeded in my prime1 problem |
|
xianenberg:
2016-04-03 16:05:27
TLE and i dont know why :( |
|
ay_bee:
2016-04-03 14:11:12
The key : Segmented Sieve :) |
|
rai009:
2016-03-27 06:58:06
best....for solving questions.....
|
|
Nonomori:
2016-03-20 13:02:40
miller rabin prime test & exponentiation by squaring is the key. |
|
zeyadetman:
2016-03-12 22:55:20
Time limit , Why ??
|
| Added by: | Adam Dzedzej |
| Date: | 2004-05-01 |
| Time limit: | 6s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: NODEJS PERL6 |
RSS