Cod sursa(job #536594)
Utilizator | Data | 18 februarie 2011 20:35:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<iostream.h>
#include<fstream.h>
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,nr,v[2000000];
f>>n;
nr=0;
for (i=2;i<=n;i++)
v[i]=i;
for (i=2;i<=n;i++)
if (v[i]!=0)
{
for (j=i+i;j<=n;j=j+i)
v[j]=0;
nr++;
}
g<<nr;
f.close();
g.close();
return 0;
}