Cod sursa(job #2089963)
| Utilizator | Data | 17 decembrie 2017 13:30:59 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur[2000001];
int main(){
int n, cnt = 0;
in >> n;
ciur[1] = 1;
for (int i = 2; i <= n; i ++){
if (!ciur[i])
cnt ++;
for (int j = 2 * i; j <= n; j += i)
ciur[j] = 1;
}
out << cnt;
return 0;
}
