| 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 Manuel Meder
hi, I'm confused now. I submitted my code 5333234 with "initial error" then I submitted that code again and get "wrong answer" tho if I calculate the Primes from 1 to 1.000.000.000 I get the 50847534 Primes returned. (So if the Primes should be okay, how come it says wrong answer) each set is separated by a blank line and the after the last set theres just a \n. For equal numbers (from x to x) there is also a blank line, is that the mistake? Edit: Problem solved! Adrian's hint helped. Last edit: 2011-07-04 11:36:00 |
||||||||||||||
|
2013-03-13 22:12:29 VICTOR JOHANN CORTEZ
10 1 100001 100002 200000 999990000 1000000000 999900000 1000000000 999900000 1000000000 1 100001 999990000 1000000000 999900000 1000000000 999990000 1000000000 1 100001 try this input to calculate... |
||||||||||||||
|
2013-03-13 22:12:29 Dan
By definition, a prime number is 1. Must be bigger than 1 2. The number must be divisible only by one and itself Actually, the m|n limit was the key for solving the problem (on my end) Happy thinking everyone :) |
||||||||||||||
|
2013-03-13 22:12:29 :D
Please move your code to the forum (probem set archive section). Comments are no place for the whole programs, your spoiling it for others! |
||||||||||||||
|
2013-03-13 22:12:29 Alca
I use Miller-Robbin( O(log n) ) and I got AC by C++ use 2 secs. but when I write the Algorithm by Python, I got TLE.. I saw some people use Python and got AC with very short time. How can they do it? |
||||||||||||||
|
2013-03-13 22:12:29 superpollo
maybe the condition n-m<=100000 might be used to increase efficiency... ? |
||||||||||||||
|
2013-03-13 22:12:29 Rakib Ansary Saikot
Another idea is to use an Erathostenes sieve that doesn't store some numbers that are certainly not prime. For example, you can store 30 numbers in one byte: only 30n+1, 30n+n+7, 30n+11, 30n+13, 30n+17, 30n+19, 30n+23 and 30n+29 can be prime. You can expand this idea to 32 bits for maximum performance. Can someone please elaborate that? |
||||||||||||||
|
2013-03-13 22:12:29 Diogo F. S. Ramos
Two main advices from whom who just beat it: * Runtime errors can be caused by a excessive use of memory. If you are using "sieve of Eratosthenes", just think how much memory would be used. * If you are using "sieve of Eratosthenes" -- which were my case -- think how the algorithm mark the non-primes and ask yourself: Do I *really* need to find _all_ the primes up to /n/? Is this what the problem asks? Last edit: 2010-07-14 05:30:41 |
||||||||||||||
|
2013-03-13 22:12:29 Jargon
@jgomo3 Many psetters will submit solutions by other people with modifications to see if they can solve a bug in the code. (I know I do.) This results in some non-accepted answers by psetters. |
||||||||||||||
|
2013-03-13 22:12:29 Kacper Wikie³
Chinese Primary test is too slow; I think Eratosthenes sieve will go faster. |
||||||||||||||
RSS