Pagini recente » Cod sursa (job #2778391) | Cod sursa (job #57020) | Cod sursa (job #2124585) | Cod sursa (job #2525772) | Cod sursa (job #884713)
Cod sursa(job #884713)
#include<cstdio>
#include<bitset>
using namespace std;
bitset<2000010> p;
int n,i,j,cnt=1;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
// n=10000000;
for(i=3;i*i<=n;i+=2)
if(!p[i])
{
cnt++;
for(j=i*i;j<=n;j+=i<<1) p[j]=1;
}
for(;i<=n;i+=2)
if(!p[i]) cnt++;
printf("%d\n",cnt);
return 0;
}