Cod sursa(job #276408)
Utilizator | Data | 11 martie 2009 10:00:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream.h>
#include<math.h>
unsigned long a[10000];
int main()
{int n,i,j,nr;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;nr=n;
for(i=2;i<=n;i++)
a[i]=1;
for(i=2;i<=sqrt(n)+1;i++)
{if(a[i]==1)
for(j=2;j*i<=n;j++)
{if(a[i*j]!=0)
{a[i*j]=0;nr--;}
}}
g<<nr-1<<'\n';
f.close();
g.close();
return 0;
}