暴力筛TLE
直接开数组MLE
#include <stdio.h>
#include <math.h>
#include <string.h>
using namespace std;
int vis[100010];
long long sushu[100010];
int shai[100010];
int main()
{
long long n,i,j,k=0;
memset(vis,0,sizeof(int));
for (i = 2;i <=46341+2 ;i++)//筛出sqrt 2^32里面的质数
{
if (!vis[i])
{
sushu[k++]=i;
for (j = i*i;j <= 46341+2;j+=i)
{
vis[j]=1;
}
}
}
scanf("%lld",&n);
for (int num =1;num<=n;num++)
{
memset(shai,0,sizeof(shai));
long long a,b,m,ns;
scanf("%lld%lld",&a,&b);
for (j = 0; j <k &&sushu[j]<=b;j++)
{
m =a/ sushu[j];
if (m*sushu[j]<a) m++;
for (ns = m;ns <=b/sushu[j];ns++)
{
if (ns*sushu[j] <= sushu[j]) continue;
shai[ns*sushu[j]-a] = 1;
}
}
int count = 0;
for (i = a;i <= b;i++)
{
if (i ==1) continue;//a==1时会出现错误
if (!shai[i-a])
count++;
}
printf("Case %d: %d\n",num,count);
}
}
在实现区间筛的时候 细节方面不断出问题(捂脸)