Cod sursa(job #549505)
Utilizator | Data | 8 martie 2011 17:55:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream.h>
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
long s=0,n,i,a[200001],p,x,j,k,ok=0;
fin>>n;a[1]=0;
for(i=2;i<=n;i++)
a[i]=1;
for(j=2;j<=n;j++)
{
if(a[j]==1)
{
for(i=2;i<=n/j;i++)
{
x=j*i;
a[x]=0;
}
}
}
for(i=1;i<=n;i++)
s+=a[i];
fout<<s;
fout.close();
return 0;
}