Cod sursa(job #475324)
Utilizator | Data | 6 august 2010 16:57:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream.h>
ifstream f("ciur.in"); ofstream g("ciur.out");
long prim[100],i,n,k,j,mk,c;
int main(){
f>>n;
for(i=2;i<=n;++i)
prim[i]=i;
for(i=2;i<=n;++i)
if(prim[i]){
c++;
for(j=i+1;j<=n;j+=i)
prim[j]=0;
}
g<<c;
f.close();g.close();
return 0;
}