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
|
aditya22_jadav:
2021-04-14 11:05:35
in c++14
|
|
|
aditya22_jadav:
2021-04-14 11:05:14
time limit exceeded what to do |
|
hemant_bansal:
2021-04-13 08:10:35
should i use scanf and printf rather than cin cout in this problem?
|
|
saisudhama_123:
2021-03-25 17:34:10
In C ,time limit exceeded what to do |
|
manoj015:
2021-03-24 07:17:28
even though my code is working in my local env. but, getting wrong answer after submitting here...Please help me?
|
|
shariqaftab333:
2021-03-17 10:13:30
i m dam sure my code is right but it is showing wrong answer
|
|
thanh913:
2021-03-14 20:11:24
Now 0.01 with scanf :3
|
|
|
thanh913:
2021-03-14 19:30:23
i got 0.06 using modified sieve :D |
|
samyakj:
2021-03-14 11:28:58
Time limit exceeded what should I do? |
|
mailforspam:
2021-03-07 01:27:05
furking piece of shit. I realized so pretty algo but site doesn't accept it and idk 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