Cod sursa(job #543132)
Utilizator | Data | 27 februarie 2011 16:30:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
long n;
char v[2000001];
int i,y,nr;
int main ()
{
f>>n;
for(i=2;i<=n;i++)
v[i]=0;
for(i=2;i<=n;i++)
if(v[i]==0) {nr++;
y=2;
while(y*i<=n) v[y*i]=1,y++;
}
g<<nr;
f.close();
g.close();
return 0;
}