Cod sursa(job #273335)
Utilizator | Data | 8 martie 2009 14:28:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream.h>
int ok[10000];
int main()
{unsigned long n,i,j,k=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
if(ok[i]==0)
{j=2;k++;
while(i*j<=n){ok[i*j]=1;
j++;
}
}
g<<k<<'\n';
f.close();
g.close();
return 0;
}