Cod sursa(job #3345971)
| Utilizator | Data | 11 martie 2026 21:28:12 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
using namespace std;
int ans;
int ciur[2000001];
long long n;
int main()
{
cin >> n;
for(int i = 2; i <= n; i++)
if(ciur[i] == 0)
for(int j = 2 * i; j <= n; j += i)
ciur[j] = 1;
for(int i = 2; i <= n; i++)
if(ciur[i] == 0)
ans++;
cout << ans;
return 0;
}
