Pagini recente » Cod sursa (job #1719831) | Atasamentele paginii denisilie | Cod sursa (job #732466) | Istoria paginii runda/sanki | Cod sursa (job #1653033)
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
int main()
{ long n;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
short *a = new short[n+10];
for(long i=2; i<=n; i++) a[i]=1;
for(long i=2; i<=long(sqrt(n)); i++){
for(long j=2; j<=n/i; j++){
a[i*j]=0;
}
}
long s=0;
for(int i=2; i<=n; i++) if (a[i]==1) s++;
fout<<s;
return 0;
}