Pagini recente » Cod sursa (job #2223662) | Cod sursa (job #1199827) | Cod sursa (job #204824) | Cod sursa (job #1915409) | Cod sursa (job #1042720)
#include<stdio.h>
#include<math.h>
char ciur[((2000000>>3)+2)];
int eratostenes(int n){
int i,j;
int prime=n;
for(i=2;i*i<=n;i++){
if(ciur[i>>3]&(1<<i&7))
continue;
for(j=i*i;j<=n;j+=i){
if(!(ciur[j>>3]&(1<<j&7)))
prime--;
ciur[j>>3]|=(1<<j&7);
}
}
return --prime;
}
int main(){
int n;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
printf("%d",eratostenes(n));
return 0;
}