Cod sursa(job #384361)
Utilizator | Data | 19 ianuarie 2010 22:25:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<iostream.h>
#include<fstream.h>
fstream f("ciur.in", ios::in);
fstream go("ciur.out", ios::out);
int n,i,j,nr, a[2000001];
int main()
{
f>>n;
for (i=2;i<=n;i++)
{ if (a[i]==0)
{nr++;
for (j=2;j<=n/i;j++)
a[i*j]=1;
}
}
go<<nr;
go.close();
return 0;
}