| 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
|
||||||||||||||
|
2018-03-30 05:43:07
0.88s :) |
||||||||||||||
|
2018-03-24 21:19:16 Johnny Nonsense
I completed this in C++ without using sieve. You can run these tests faster by retaining a list of primes from one test to the next. Extend the list as necessary, up to and not exceeding sqrt(M). When determining whether a number is prime, you only have to divide it by all prime numbers in the list up to the square root of the test number. If this method doesn't work in some language other than c++, then maybe the tester is too restrictive in the time constraint for that particular language. I hope that this makes sense. |
||||||||||||||
|
2018-03-23 10:32:34
please somebody tell me why my code is giving WA .its running perfectly fine for large numbers too. please suggest some sample test cases to try .code <script src="https://ideone.com/e.js/kz8jcj" type="text/javascript" ></script> |
||||||||||||||
|
2018-03-08 17:58:16
Segmented sieve is the solution, but you need to implement it properly or you will hit TLE. For example, see <snip> Last edit: 2022-06-19 12:12:56 |
||||||||||||||
|
2018-03-06 15:08:28
what is sc here btw a total noob here |
||||||||||||||
|
2018-03-05 07:07:47
Yeah, sieve is not necessary |
||||||||||||||
|
2018-03-02 14:26:12
segmented seive means applying simple seive again on already computed primes(small range) to get primes ahead |
||||||||||||||
|
2018-02-19 08:38:46
anyone got AC in python 3? i am using segment sieve... still TLE |
||||||||||||||
|
2018-02-12 23:28:35
ARH.... my (C++) code works perfectly fine, but i get 'wrong answer' all the time.... this sucks if you don't get any advice why it's wrong if it works..... :/ |
||||||||||||||
|
2018-02-12 13:32:02
I've used 2 to sqrt(number) to solve the problem.Solution is accepted but the time is over 1 sec(1.15). How do I reduce the compilation time. BTW I've used C++ to code. |
||||||||||||||
RSS