Cod sursa(job #161844)
Utilizator | Data | 18 martie 2008 21:10:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream.h>
long long ok[2000006],i,j,n,k;
int main()
{ ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
i=2;
while(i*i<=n)
{ if(!ok[i])
{ j=2;
while(i*j<=n)
{ ok[i*j]=1;
j++;
}
}
i++;
}
for(i=2;i<n;i++)
if(ok[i]) k++;
fout<<k;
return 0;
}