Cod sursa(job #2763509)
Utilizator | Data | 14 iulie 2021 17:47:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
#define NMAX 2000000
bool ciur[NMAX + 1];
int main() {
int n, i, cnt;
long long d;
cin >> n;
cnt = 0;
for ( i = 2; i <= n; i++ ) {
if ( ciur[i] == 0 ) {
cnt++;
for ( d = (long long)i * i; d <= n; d += i ) {
ciur[d] = 1;
}
}
}
cout << cnt;
return 0;
}