Cod sursa(job #2302820)
Utilizator | Data | 15 decembrie 2018 10:37:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<stdio.h>
char p[2000001];
int i,j,k,n,l;
int main()
{
freopen("ciur.in","r",stdin),freopen("ciur.out","w",stdout),scanf("%d",&n);
for(i=3;i<=n;i+=2)
{
if(p[i>>4]&(1<<((i>>1)&7)))
continue;
for(k++,j=i+(l=i+i);j<=n;j+=l)
p[j>>4]|=1<<((j>>1)&7);
}
printf("%d",k+1);
}