Pagini recente » Cod sursa (job #990862) | Istoria paginii runda/cevaproblemeoji/clasament | Cod sursa (job #551500) | Cod sursa (job #922033) | Cod sursa (job #778203)
Cod sursa(job #778203)
#include<fstream>
#include<cmath>
using namespace std;
bool a[10000002];
int main(void){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int i,j,n,k,nr=0;
fin>>n; fin.close();
k=int(sqrt(n));
for(i=2;i<=k;++i)
if(!a[i])
for(j=2;j<=n/i;++j)a[i*j]=1;
for(i=2;i<=n;++i)if(!a[i])++nr; fout<<nr;
fout.close();
return 0;
}