Cod sursa(job #288581)
Utilizator | Data | 25 martie 2009 22:19:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream.h>
#define MAX 2000002
long n;
int nr=0;
char a[MAX];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{long i,j;
f>>n;
for(i=2;i<=n;i++)
{if(!a[i]){nr++;
for(j=2*i;j<=n;j+=i)
a[j]=1;
}
}
g<<nr;
g.close();
f.close();
return 0;
}