Pagini recente » Cod sursa (job #3193463) | Cod sursa (job #1645896) | Cod sursa (job #147068) | Arhiva educationala - tehnici de programare, algoritmi clasici | Cod sursa (job #163987)
Cod sursa(job #163987)
#include <stdio.h>
char ciur[2000002];
long prim[149000];
int main ()
{freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
long n,i,j,vf=1;
scanf("%ld",&n);
ciur[1]=1;
for (i=4;i<=n;i+=2)ciur[i]=1;
for (i=3;i<=n;i+=2)
{if(ciur[i]==0)
{prim[++vf]=i;
for (j=3*i;j<=n;j+=2*i)
ciur[j]=1;
}
}
for (j=0,i=1;i<=n;i++)
{if(ciur[i]==0)
j++;
}
printf("%ld",j);
return 0;
}