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
|
kotal_kahn1:
2017-10-25 20:06:11
did it using java , but same code in python shows time limit exceeded
|
|
evilspirit:
2017-10-22 09:18:13
0.12s
|
|
luckytuvshee:
2017-10-15 02:17:42
Hi all. Please show me the source code? What is prime generator :) Help |
|
jgaurav6:
2017-10-11 21:17:42
getting nzec error in java even with correct output :( |
|
prasadjoshi:
2017-10-04 09:33:17
finally done in 0.58s in C++ |
|
mani_kasera:
2017-09-30 07:18:31
No need of advanced algorithm, just check if every no. in between, m and n is prime or not by running a loop from 2 to square root of that number. It will definitely work in c++. Last edit: 2017-09-30 07:20:53 |
|
slothse7en:
2017-09-29 10:00:43
nhật hào sạch |
|
killercode:
2017-09-28 19:41:03
using sieve of eratosthenes in python 3, still time limit exceeded wtf |
|
nmirandaghn:
2017-09-27 10:57:24
What are the test cases of this puzzle? |
|
anonymousamigo:
2017-09-25 12:01:42
use dynamic programming.
|
| 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