Cod sursa(job #280408)
Utilizator | Data | 13 martie 2009 12:57:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream.h>
#define dim 2000001
char v[dim];
int main ()
{
long n,j,k=0,i;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
{
k++;
for(j=i;j*i<=n;j++)
v[j]=1;
}
g<<k-1;
f.close();
g.close();
return 0;
}