Cod sursa(job #244872)
Utilizator | Data | 16 ianuarie 2009 10:50:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream.h>
char ok[2000005];
int i,j,k;
long n;
int main()
{ ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i*i<=n;i++)
if(!ok[i])
{ j=2;
while(i*j<=n)
{ ok[i*j]='1';
j++;
}
}
for(i=2;i<=n;i++)
if(!ok[i]) k++;
fout<<k;
return 0;
}