| Submit | All submissions | Best solutions | Back to list |
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.| 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 |
hide comments
|
||||||||||||||
|
2013-03-13 22:12:29 Prateek Taori
time limit is for execution or compilation? |
||||||||||||||
|
2013-03-13 22:12:29 Abi
how to apply sieve by giving starting and ending range.if i start from 2 and proceed as sieve algo it is again showing time limit exceeded |
||||||||||||||
|
2013-03-13 22:12:29 Aditya Pande
plz check submission ID 7094038. it is giving WA but i dont know why |
||||||||||||||
|
2013-03-13 22:12:29 iostream
@naveen bansal even I am getting the same problem , it is showing 0.01 sec on ideone but shows "time limit exceeded ' on Spoj , Plz help if u get to a solution thanx |
||||||||||||||
|
2013-03-13 22:12:29 Abi
when iam running my code on ideone.com it shows success 0.01s but when i submit on spoj it shows runtime error(SIGSEGV).pls anyone help |
||||||||||||||
|
2013-03-13 22:12:29 Naveen Bansal
I am getting 'Time Limit Exceeded error' but when i run the code on ideone.com, its running successfully in just 0.02 secs. Please see the ideone.com statistics below- result: Success time: 0.02s memory: 2864 kB returned value: 0 Help please! |
||||||||||||||
|
2013-03-13 22:12:29 Mr. Rook
may this wuld help u what is the max no u need to check if no is prime or no??? |
||||||||||||||
|
2013-03-13 22:12:29 Mr. Rook
hint is u only need array of size <1,000,000,000 if u think little bit |
||||||||||||||
|
2013-03-13 22:12:29 Mads
Use segmented sieve explained on this link http://programmingpraxis.com/2010/02/05/segmented-sieve-of-eratosthenes/ |
||||||||||||||
|
2013-03-13 22:12:29 Neha Kumari
if we are using sieve how can it be done without taking an array of size 1000000000, plz giv sm hint |
||||||||||||||
RSS