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
|
armitage226:
2020-03-20 16:05:32
how do i take input with a space in between in c++ |
|
navin123:
2020-03-18 12:59:01
aparna_15
|
|
nathanaxel:
2020-03-18 05:09:39
puede |
|
aparna_15:
2020-03-16 09:36:30
when i am running my code in other ide... my code is correct and giving the correct output but when i submit it here its givng time limit exceeded error.
|
|
lucifer1004:
2020-03-10 11:16:15
@sobrevivente, the first line is t (number of test cases). |
|
sobrevivente:
2020-03-08 21:26:23
I don't understand how mine doesn't work:
|
|
mohit827:
2020-03-08 03:39:21
I use sieve of Eratosthenes in python but it still gave time limit exceeded. What can i do |
|
hoangbonduy123:
2020-02-21 08:36:09
wow the time limit is large |
|
|
hoangbonduy123:
2020-02-21 08:35:41
Easy AC |
|
shafaet:
2020-02-19 02:51:53
segment sieve or bit-wise sieve will be the best choice for beginner |
| 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