Cod sursa(job #387391)
Utilizator | Data | 27 ianuarie 2010 15:50:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
#define N 2000100
int v[N/8], n, i, j, nmax, nr;
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d", &n);
for (i = 2; i <= n; i++){
if (!(v[i/8] & (1<<(i%8)))){
nr++;
for (j = 2 ,nmax = n/i; j <= nmax; j++)
v[j*i / 8] |= 1 << (j*i % 8);
}
}
printf("%d", nr);
return 0;
}