Cod sursa(job #422348)
Utilizator | Data | 22 martie 2010 16:00:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream.h>
int a[2000009],i,k=1,j,n;
int main()
{ifstream f("ciur.in"); ofstream g("ciur.out");f>>n;
for(i=1;i<=n;i++)
a[i]=i;
for(i=4;i<=n;i=i+2)
a[i]=0;
for(i=3;i<=n;i=i+2)
if(a[i]!=0) {k++;for(j=2*i;j<=n;j=j+i)
a[j]=0;}
g<<k;
return 0;}