题目链接:http://www.spoj.com/problems/PRIME1/
题目大意:T组数据(T<=10),每组数据两个数n,m(n,m<=1e9),且n<=m,要求输出在[n,m]区间内的所有质数。n,m满足n-m<=100000
题目分析:筛40000以内的质数,然后从n枚举到m判断即可
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=40000;
bool mark[maxn];
int prim[maxn],primm=0;
void Get_Prime()
{
for (int i = 2; i <= 40000; i++)
{
if (!mark[i]) prim[++primm] = i;
for (int j = 1; prim[j] * i <= 40000; j++)
{
mark[prim[j] * i] = true;
if (i % prim[j] == 0) break ;
}
}
}
int main()
{
int T;
Get_Prime();
cin>>T;
while (T--)
{
int n,m;
scanf("%d %d",&n,&m);
if (n==1) n++;
for (int i=n;i<=m;i++)
{
int flag=0;
for (int j=1;j<=primm,prim[j]*prim[j]<=i;j++)
if (i%prim[j]==0)
{
flag=1;
break;
}
if (!flag) printf("%d\n",i);
}
printf("\n");
}
return 0;
}