Cod sursa(job #352455)
| Utilizator | Data | 1 octombrie 2009 21:17:21 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int n, v[2 000 001], nr;
int main()
{ f >> n;
for (int i=3; i<=n; i+=2)
if (!v[i])
{ nr++;
for (int j=i*2; j<=n; j+=i)
v[j]=1;
}
g << nr ;
return 0;
}
