题意:T<=200组样例,每组样例给两个数a,b(1<=a<=b<=2^31),求[a,b]内的素数个数。
题解:线筛1e5内的数,然后再像埃氏筛一样筛a,b内的数。
补充:一直RE不知道咋回事,改成long long莫名过了。
RE的情况是程序运行到一半崩溃了,要么/0,要么数组越界。这里应该是数组越界了,可能j>r,又因为j>2^31(int 最多到2^31)变成小数了emmm,然后调用vis[j-l]就数组越界了!!!!!!!!!!!!!(匹夫无罪,怀璧其罪。RE还是只记/0,数组越界的情况,但是要注意超int这种越界的情况!!!)
代码:
#include <bits/stdc++.h>
#define int long long
#define read(x) scanf("%lld", &x)
#define print(a, c) printf("%lld%c", a, c)
#define dbg(x) cout << #x << "===" << x << endl
#define pb push_back
using namespace std;
const int N = 1e5 + 10;
int a, b;
int vis[N], p[N];
void Prime(int n) {
int i, j;
for (i = 2; i <= n; i++) {
if (vis[i]) continue;
p[++p[0]] = i;
for (j = 2 * i; j <= n; j += i) vis[j] = 1;
}
vis[1] = 1;
}
int solve(int l, int r) {
memset(vis, 0, sizeof(vis));
int i, j;
for (i = 1; i <= p[0] && p[i] * p[i] <= r; i++) {
j = l - l % p[i];
//精髓::
if (j < l) j += p[i];
if (j == p[i]) j += p[i]; //可能从0起步
// dbg(j);
for (; j <= r; j += p[i]) vis[j - l] = 1;
}
int res = 0;
for (i = l; i <= r; i++)
if (vis[i - l] == 0 && i != 1) //等到这里才特判 1
res++; //, dbg(i);
return res;
}
signed main() {
int T;
read(T);
Prime(N - 1);
for (int _ = 1; _ <= T; _++) {
read(a), read(b);
printf("Case %lld: %lld\n", _, solve(a, b));
}
return 0;
}
/*
input:::
3
2 36
3 73
3 11
output:::
Case 1: 11
Case 2: 20
Case 3: 4
*/