Pagini recente » Cod sursa (job #1175484) | Cod sursa (job #2903614) | Cod sursa (job #3203695) | Cod sursa (job #1042944) | Cod sursa (job #273755)
Cod sursa(job #273755)
#include <stdio.h>
#include <math.h>
long i,j,k,n;char prim[500000];
int main()
{freopen("ciur.in","r",stdin);freopen("ciur.out","w",stdout);
scanf("%ld",&n);
k=1;
for(i=3;i<=n;i+=2)
{if(prim[i>>4]&(1<<((i>>1)&7)))continue;
k++;for(j=i+i+i;j<=n;j+=i+i)prim[j>>4]|=1<<((j>>1)&7);
}
printf("%ld",k);fclose(stdin);fclose(stdout);
return 0;
}