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, nm<=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
kalashnikov_56:
20230908 17:32:08
for tc m = 1 change it to 2 to avoid printing 1. 

hatata:
20230828 15:54:23
you can save answers in unordered_map and find divisors in range of [2,sqrt(x)] 

dungprolh:
20230819 13:29:11
is it possible to create an array with 1 billion items in C++. I met SIGTERM error 

ternion1121:
20230815 19:12:30
my solution works totally fine using segmented sieve in my ide (g++ version 8 (something))


phu15:
20230812 05:57:57
why did I get runtime error?may i know the reason? 

diskyjava:
20230627 07:45:33
how and where to find the solution or editorial? please provide the link Last edit: 20230627 08:12:48 

oh_utkarsh:
20230622 19:54:11
What might be the problem if I get runtime error? 

firefoxbn_01:
20230605 01:58:18
if you got TLE, may be you looped check prime from 1 to n, just change it to check from 1 to sqrt(n) then it should be OK 

hongnam207:
20230429 09:21:01
what the f**k is that I used the sieve of eratostenes and TLE but when I don't, I passed


deuncle_16:
20230418 17:31:19
Guys try to search for Sieve of Eratosthenes 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 