Cod sursa(job #548901)
Utilizator | Data | 7 martie 2011 21:57:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
long long n,i,x=0,j;
char a[2000000];
int main()
{
f>>n;
for(i=1;i<=n;i++)
a[i]=1;
for(i=1;i<=n;i++)
if(a[i]==1)
{
for(j=i;j<=n;j+=i)
a[j]=0;
x++;
}
g<<x;
return 0;
f.close();
g.close();
}