Cod sursa(job #672370)
| Utilizator | Data | 1 februarie 2012 22:26:21 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
# include <fstream>
# define dim 2000001
using namespace std;
int main(void){ifstream fin("ciur.in"); ofstream fout("ciur.out");
long int n,i,j,nr=1;
char ok[dim];
for(i=0;i<dim;i++)
ok[i]=1;
fin>>n;
for(i=3;i*i<=n;i++)
if(ok[i]){
j=3;
while(i*j<=n){
ok[i*j]=0;
j++;
}
}
for(i=3;i<=n;i+=2)
if(ok[i]) nr++;
fout<<nr;
fout.close();
fin.close();
return 0;
}