Cod sursa(job #788546)
| Utilizator | Data | 15 septembrie 2012 12:42:18 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
#define Max 2000002
int n,nr;
unsigned char p[Max>>3];
void ciur()
{
int i=2;
while(i<=1414)
{
while(p[i>>3] & 1<<(i&7))i++;
for(int j=i*i;j<Max;j+=i)p[j>>3]|=1<<(j&7);
i++;
}
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
ciur();
for(int i=2;i<=n;i++)
if(!(p[i>>3] & 1<<(i&7)))nr++;//printf("%d ",i);
printf("%d\n",nr);
return 0;
}
