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