Pagini recente » Cod sursa (job #3144681) | Cod sursa (job #374510) | Cod sursa (job #381222) | Cod sursa (job #2965368) | Cod sursa (job #1042710)
#include<stdio.h>
#include<math.h>
char ciur[((2000000/8)+2)];
int eratostenes(int n){
int i,j;
int prime=n;
for(i=2;i<=sqrt(n);i++){
while(ciur[i/8]&(1<<i%8)) i++;
for(j=i*i;j<=n;j+=i){
if(!(ciur[j/8]&(1<<j%8)))
prime--;
ciur[j/8]|=(1<<j%8);
}
}
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;
}