Cod sursa(job #522302)
| Utilizator | Data | 14 ianuarie 2011 19:59:31 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream.h>
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
int ciur(int x)
{ bool p[2000002];
int i,j,nr=0;
for(i=2; i<=x; i++)
if(!p[i])
{ nr++; for(j=i+i; j<=x; j+=i) p[j]=1;}
return nr;
}
int main()
{ fin>>n; fout<<ciur(n)<<'\n';}
