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
|
nagrahari:
2019-05-16 11:40:46
how to take input and give output?
|
|
itsmysyntax:
2019-04-21 16:19:56
follow this tutorial this could help you https://medium.com/@agilanbtdw/prime-number-generation-in-java-using-segmented-sieve-of-eratosthenes-187af1dcd051 |
|
charlles:
2019-04-09 16:35:18
tips:
|
|
vasunaidu:
2019-04-07 14:23:56
Showing time limit exceeded for prime generator. |
|
piecyk:
2019-04-05 10:01:13
I get input error, tried python 2.7 raw_input() and python 3 input()
|
|
f20180295:
2019-04-05 08:15:10
it is showing time limit error what to do |
|
keshav_garg27:
2019-04-02 15:16:20
it works fine even on ideone but here it shown time limit exceeded.
|
|
ahsan_habib:
2019-04-02 14:40:33
sala point discis na kn?? |
|
ravikuril:
2019-03-25 16:01:03
segmented sieve |
|
adarshanp_01:
2019-03-18 11:06:19
it works fine even on ideone but here it shown time limit exceeded.
|
| 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