Pagini recente » Cod sursa (job #1526769) | Cod sursa (job #1863200) | Cod sursa (job #188219) | Cod sursa (job #376518) | Cod sursa (job #1369677)
#include <cstdio>
using namespace std;
int n;
bool p[1000010];
int ciur(int n)
{
int i,j,nr=1;
for(i=1;2*(i*i+i)<=n;i++)
if(p[i]==0)
{
for(j=2*(i*i+i);2*j+1<=n;j+=2*i+1)
p[j]=1;
}
for(i=1;2*i+1<=n;i++)
if(p[i]==0)nr++;
return nr;
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
printf("%d",ciur(n));
return 0;
}