LightOJ 1197 Help Hanzo (大区间素数筛)

题意：求区间素数个数。

题解：大区间素数筛

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<map>
#define ll long long
using namespace std;

int t, a, b;
const int MAXN = 100010;
int prime[MAXN + 1];
void getPrime() {  //先处理区间大小的素数
    memset(prime, 0, sizeof(prime));
    for (int i = 2; i <= MAXN; i++) {
        if (!prime[i])prime[++prime[0]] = i;
        for (int j = 1; j <= prime[0] && prime[j] <= MAXN / i; j++) {
            prime[prime[j] * i] = 1;
            if (i % prime[j] == 0)break;
        }
    }
}
bool notprime[MAXN * 10];
int prime2[MAXN * 10];
void getPrime2(int L, int R) {
    memset(notprime, false, sizeof(notprime));
    if (L < 2)L = 2;
    for (int i = 1; i <= prime[0] && 1ll * prime[i] * prime[i] <= R; i++) {
        int s = L / prime[i] + (L % prime[i] > 0);
        if (s == 1)s = 2;
        for (int j = s; (long long)j * prime[i] <= R; j++)
            if ((long long)j * prime[i] >= L)
                notprime[j * prime[i] - L] = true;
    }
    prime2[0] = 0;
    for (int i = 0; i <= R - L; i++)
        if (!notprime[i])
            prime2[++prime2[0]] = i + L;
}

int main() {
    getPrime();
    int cas = 0;
	scanf("%d", &t);
	while (t--) {
		scanf("%d%d", &a, &b);
        getPrime2(a, b);
        printf("Case %d: %d\n", ++cas, prime2[0]);
	}
	return 0;
}