Cod sursa(job #550281)
| Utilizator | Data | 9 martie 2011 12:37:07 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream.h>
bool v[2000001];
int main()
{
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int i, j, n, contor = 0;
f >> n;
for (i = 2; i <= n; i ++)
if (!v[i])
for (j = i * 2; j <= n; j += i)
v[j] = true;
for (i = 2; i <= n; i ++)
if (!v[i])
contor ++;
g << contor;
f.close();
g.close();
}
