Cod sursa(job #2357136)
| Utilizator | Data | 27 februarie 2019 10:05:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in"); ofstream g("ciur.out");
int nr; c[2000005];
int main() {
int i,j;
f>>n;
nr = 1;
for(i = 3; i <= n; ++i) {
c[i] = 1;
}
for(i = 3; i * i <=n; i += 2) {
if(c[i]) {
for( j = i*i; j<= n; j +=i) c[j] = 0;
}
}
for(i = 3; i <=n; i +=2) {
if (c[i]) ++nr;
}
g<<nr;
return 0;
}
