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
|
mychemromance:
2016-06-17 16:26:53
I've tried it many times, made my code more efficient, yet the time limit is exceeded! |
|
vaibhavahuja:
2016-06-16 03:20:23
yeah, time limit exceeded. come on? |
|
|
mychemromance:
2016-06-13 16:17:58
Time limit exceeds all the time!
|
|
ayushgaurav:
2016-06-09 07:39:21
time limit exceeded??
|
|
ruzihm:
2016-06-07 17:58:54
Only 2 submissions not TLE in nim. hahahaha.
|
|
cdgid7:
2016-06-07 11:00:10
C++ used about 2s and accepted, but lua got TLE with same algorithm |
|
rivas:
2016-06-06 12:42:48
My algorithm is working fine on ideaone as well as locally even with large values. But I keep getting Runtime Error NZEC. Has anyone else seen this issue? |
|
akmal_24:
2016-06-03 17:49:00
time limit exceeded. java is slow language, so PROBLEM SETTERS should give more time limit if the answer is in java.
|
|
codepy:
2016-06-01 10:10:48
time limit exceeded, no idea why????
|
|
rishabmalik121:
2016-06-01 01:20:38
those who are getting runtime error in python don't do it with files |
| 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