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
|
devanshu95:
2016-08-31 15:28:14
how are you all storing the result.?
|
|
ashish16iitr:
2016-08-29 19:58:58
whats the time limit for this question?
|
|
hush01:
2016-08-24 21:07:03
this is tough! Last edit: 2016-08-24 21:14:30 |
|
k_dhingra2013:
2016-08-24 08:55:43
did it using sieve in just 0.01 seconds |
|
hashem sllat:
2016-08-18 12:49:16
binary search + sieve 0.24s |
|
vivace:
2016-08-18 11:28:31
do not use sieve of eratosthenes because you'll need to take an array to mark the numbers . In this question , the input size can be 10^9 . an array of this will give a runtime error( due to segmentation fault/memory limit exceeded) . either use common sense or use segmented sieve approach . |
|
itsmedavid:
2016-08-14 21:05:50
my code runs on ideone within 5s but here the time limit is 6s and it still shows time limit exceeded. anyone has any idea ? |
|
coder_hsnake:
2016-08-12 13:15:25
ac in one go!!!!!!!!! without using sieve think simple :-) |
|
mouradsme:
2016-08-07 11:06:25
I wrote my code in php, and tested it on ideone and had the same results concerning the execution time (less than 0.0002 seconds) but when I submit it, it says that the time was exceeded? Last edit: 2016-08-07 11:09:45 |
|
gd_8038:
2016-08-02 19:04:10
how to check test cases for which my solution is giving wrong answer?
|
| 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