| 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
|
||||||||||||||
|
2019-08-21 19:42:23
the code works in cpp while the same sqrt logic doesn't work in python 3 ? |
||||||||||||||
|
2019-08-20 01:17:51
my code works perfectly when i run it on my machine ( using C ), but when i upload the file it says wrong answer, what's going on here ?? |
||||||||||||||
|
2019-08-13 14:04:51
Hi ALL, iam new to c++ my code have time issue can some one tell me what i can do to make it faster i am using pair<int,int> sqrt(n) method and 4 for loops 1st for loop for input 2nd to caal by reference the prime function 3 and 4 are inside the prime generator Last edit: 2019-08-13 14:07:59 |
||||||||||||||
|
2019-08-13 04:13:12
Make sure that your segmented sieve only goes up to root of n. This will avoid TLE. |
||||||||||||||
|
2019-08-08 20:49:35
while ideone my program. it compiling in 0.1 sec. and in your compiler time limit is existing |
||||||||||||||
|
2019-08-03 13:50:57
Giving TLE when i used nested for loops and runtime error(SIGFPE) when used recursion reducing one loop which identify the no prime.HELP--- Last edit: 2019-08-03 13:52:03 |
||||||||||||||
|
2019-07-29 12:58:08
I used the segmented sieve algo. The code works fine in visual studio ide but gives segmentation fault in spoj (runtime error(SiGSEGV). How to remove that error. Last edit: 2019-07-29 12:58:44 |
||||||||||||||
|
2019-07-29 08:29:31
Used segmented seive but it is still giving TLE...... |
||||||||||||||
|
2019-07-23 16:15:58
It gives me a time limit exceeded error every time. I tried running code on jDoddle online compiler, the time is 0.04s with 5 test cases. What could be the problem? |
||||||||||||||
|
2019-07-18 06:53:34
How to fix runtime error in python 3?? So basically please tell me how to take input from python which works for this site! |
||||||||||||||
RSS