Cod sursa(job #1772267)
Utilizator | Data | 6 octombrie 2016 16:59:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
int v[2000000];
int main() {
std::ifstream fin("ciur.in");
std::ofstream fout("ciur.out");
int nr = 0, n;
fin >> n;
for(int i = 2; i <= n; ++i) {
if(v[i] == 0) {
nr++;
for (int j = i * i; j <= n; j += i) {
v[j] = 1;
}
}
}
fout << nr;
fin.close();
fout.close();
return 0;
}