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
|
kiju12:
2017-11-16 07:35:45
i dont understand.. in the simulator i am getting the correct answer. but when i submit it, some problem is coming.. |
|
sdbhavsar:
2017-11-15 19:01:12
my code is running fine on codeblocks IDE but it shows me time limit exceeded. What is optimized method for this?
|
|
prini17:
2017-11-08 23:10:34
for prime generator result on idone is in 0.01s 27616KB , showing time limit exceed after submission?? |
|
coding_lover:
2017-11-08 02:37:20
where can I see my submitted code?
|
|
milkyywayy:
2017-11-02 08:54:33
limit time. Last edit: 2017-11-02 08:55:15 |
|
kundan_2508:
2017-11-02 03:05:46
My code is correct but it is showing run time error....help me Last edit: 2017-11-02 03:06:09 |
|
rashmit:
2017-10-30 09:22:27
tle is there for more than 20000
|
|
kegoru:
2017-10-30 03:18:33
done in 0.01s in C++ |
|
kotal_kahn1:
2017-10-25 20:06:11
did it using java , but same code in python shows time limit exceeded
|
|
evilspirit:
2017-10-22 09:18:13
0.12s
|
| 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