Cod sursa(job #544640)
Utilizator | Data | 1 martie 2011 21:20:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
char prim[2000005];
int n, nr;
int main()
{f>>n;
nr=0;
for(int i=2;i<=n;i++) prim[i]=1;
for(int i=2;i<=n;i++) if(prim[i]!=0) {nr++;
for(int j=i+i;j<=n;j+=i) prim[j]=0;
}
g<<nr<<"\n";
g.close();
return 0;
}