Cod sursa(job #889379)
Utilizator | Data | 24 februarie 2013 14:26:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, nr, i, j, v[2000001];
int main() {
fin >> n; nr++;
for (i = 3; i <= n; i = i + 2) {
if (v[i] == 0) {
nr++;
for (j = i + i; j <= n; j = j + i)
v[j] = 1;
}
}
fout << nr;
}