// http://www.spoj.com/problems/PRIME1/
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int main()
{
int casen;
cin >> casen;
while(casen--)
{
int n,m;
cin >> n >> m;
int * primes = new int[m-n+1];
for(int i=0;i<m-n+1;++i)
primes[i] = 0;
for(int p=2;p*p<=m;++p)
{
int less = n / p;
less *= p; // first number <= N && p divides N
for(int j=less;j<=m;j+=p) if(j != p && j >= n)
primes[j - n] = 1;
}
for(int i=0;i<m-n+1;++i)
{
if(primes[i] == 0 && n+i != 1) // We don't want to print if it's 1
cout << (n+i) << endl;
}
if(casen)
cout << endl;
delete [] primes;
}
}
Prime Generator
最新推荐文章于 2021-02-12 14:47:40 发布