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
|
sourav_bh:
2018-07-19 05:45:48
Tle in c. |
|
neel_2000:
2018-07-18 13:32:28
How shall I make sure the time limit is not exceeded while I am using C++(gcc 4.3.2) ? |
|
learnerinblack:
2018-07-14 21:05:39
Done in O(sqrt(N)*loglogN) + t*(m-n)) N = 1e9 :D |
|
rogu_auto:
2018-07-13 16:02:35
i think u should code this with pascal :) |
|
shubham_here:
2018-07-11 08:14:33
How to take input m and n using std::cin in c++ seperated by spaces. |
|
nitishyadav169:
2018-07-03 08:52:38
trongtd1973 what will we use at the place of %?
|
|
jack_greene999:
2018-06-28 19:37:40
AC in one go B-) |
|
sampreetsingh:
2018-06-27 08:26:34
I did my code in python and it is showing TLE
|
|
trongtd1973:
2018-06-19 04:03:33
@bluenokia: I think, in "check prime" funtion u should stop checking when k%i==0, It's the main proplem ;) |
|
milw0rm_007:
2018-06-14 10:36:35
Time limit exceeding in Java... How to get through this?
|
| 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