求a-b内素数个数,a,b在int范围内,但是b-a <= 100000
先打好素数表,在用素数筛法把a-b区间的非素数给筛掉
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int mx = 1e6+100;
bool vis[mx];
bool isprime[mx];
int prime[mx];
int cnt = 0;
void getPrimes()
{
int m = (int)sqrt(mx+0.5);
memset(vis, false, sizeof(vis));
for (int i = 2; i < mx; i++)
{
if (!vis[i])
{
prime[cnt++] = i;
for (int j = i*2; j < mx; j+=i)
vis[j] = true;
}
}
}
int main()
{
//freopen("out.txt","w",stdout);
getPrimes();
int T,kase = 0;
scanf("%d",&T);
while (T--)
{
memset(isprime, true, sizeof(isprime));
ll a, b;
scanf("%lld%lld",&a,&b);
ll ans = b - a + 1;
if (a == 1) ans--;
for (int i = 0; i < cnt && 1LL*prime[i]*prime[i] <= b; i++)
{
for (ll j = a/prime[i]*prime[i]; j <= b; j += prime[i])
if (j >= a && j > prime[i]) isprime[j-a] = false;
}
for (int i = 0; i <= b-a; i++)
if (!isprime[i]) ans--;
printf("Case %d: %lld\n",++kase,ans);
}
return 0;
}