Pagini recente » Cod sursa (job #1726361) | Cod sursa (job #1628393) | Cod sursa (job #1769426) | Cod sursa (job #2632034) | Cod sursa (job #897421)
Cod sursa(job #897421)
#include <stdio.h>
#include <math.h>
using namespace std;
int v[1000005],n;
void ciur()
{
int i,j,lim;
lim=sqrt(n);
v[0]=1;
v[1]=1;
for(i=4;i<=n;i+=2)
v[i]=1;
for(i=3;i<=lim;i+=2)
if(v[i]==0)
for(j=i*i;j<=n;j+=2*i)
v[j]=1;
}
int main()
{
int i,nr=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
ciur();
for(i=1;i<=n;i++)
if(v[i]==0)
nr++;
printf("%d",nr);
return 0;
}