Pagini recente » Cod sursa (job #1225167) | Cod sursa (job #2509674) | Cod sursa (job #1483999) | Cod sursa (job #281836) | Cod sursa (job #650558)
Cod sursa(job #650558)
#include<iostream>
#include<cstdio>
#include<cmath>
int n;int i,j,k,a[3000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=3;i<=n;i=i+2)
a[i]=1;
for(i=3;i<=sqrt(n);i=i+2)
if(a[i]==1)
{
k=(n-i)/i;
j=2;
while(j<=k+1)
{
a[i*j]=0;j=j+1;
}
}
k=0;
for(i=3;i<=n;i=i+2)
if(a[i]==1)k++;
printf("%d\n",k+1);
return 0;
}