Cod sursa(job #298155)
Utilizator | Data | 5 aprilie 2009 21:27:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
long n,i,j,k=0;
char a[2000005];
int main ()
{
f>>n;
for (i=2; i<=n; i++)
a[i]=1;
for (i=2; i<=n; i++)
if(a[i]==1)
{
k++;
for (j=i+i; j<=n; j+=i)
a[j]=0;
}
g<<k;
return 0;
}