0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-25 17:12:02 +00:00
OI-codes/Luogu/P1835/P1835.cpp
2022-01-18 16:57:42 +08:00

37 lines
790 B
C++

#include <cstring>
#include <iostream>
using std::cin;
using std::cout;
using std::endl;
const int N = 1000005;
long long l, r, cnt, primes[N], ans;
bool vis[N];
int main() {
for (int i = 2; i <= 1000000; i++) {
if (!vis[i]) {
primes[++cnt] = i;
for (int j = i; j <= 1000000; j += i) {
vis[j] = true;
}
}
}
cin >> l >> r;
memset(vis, 0x00, sizeof(vis));
l = std::max(l, 2ll);
for (int i = 1; i <= cnt; i++) {
long long p = primes[i];
for (long long j = std::max((l + p - 1) / p * p, p * 2); j <= r; j += p) {
vis[j - l + 1] = true;
}
}
for (int i = 1; i <= r - l + 1; i++) {
if (!vis[i]) ans++;
}
cout << ans << endl;
return 0;
}