无解报错 求条

#include <bits/stdc++.h>
using namespace std;

vector<int> prime;
const int N = 2147483647;
bool is_prime[N];

void Eratosthenes(int n) {
  is_prime[0] = is_prime[1] = false;
  for (int i = 2; i <= n; ++i) is_prime[i] = true;
  for (int i = 2; i <= n; ++i) {
    if (is_prime[i]) {
      prime.push_back(i);
      if ((long long)i * i > n) continue;
      for (int j = i * i; j <= n; j += i)
        is_prime[j] = false; 
    }
  }
}

int main () {
    int l, r, ans = 0;
    cin >> l >> r;
    for (int i = l; i <= r; i++)
        if (is_prime[i])
            ans++;
    cout << ans << endl;
    return 0;
}