Pagini recente » Cod sursa (job #1214797) | Cod sursa (job #3132263) | Cod sursa (job #1318786) | Cod sursa (job #2051125) | Cod sursa (job #634039)
Cod sursa(job #634039)
#include<cstdio>
#include<bitset>
using namespace std;
bitset<1000000> a;
int i,j,k,n,m,s=1;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
if(n&1);else n--;
m=(n-1)/2;
for(i=1,j=3;j*j<=n;i++,j+=2)
if(a[i]==0)
for(k=(j*j-1)/2;k<=m;k+=j)
a[k]=1;
for(i=1;i<=m;i++)
if(!a[i])s++;
printf("%d",s);
return 0;
}