Cod sursa(job #160434)
Utilizator | Data | 15 martie 2008 18:11:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
#define max 2000002
short int a[max];
long int i,n,j,nr;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
fin>>n;
for(i=2;i<=n;i++)
if(!a[i])
{
nr++;
for(j=2*i;j<=n;j+=i)
a[j]=1;
}
fout<<nr;
fin.close();
fout.close();
return 0;
}