Cod sursa(job #334470)
Utilizator | Data | 26 iulie 2009 21:45:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
#define N 2000005
char p[N];
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int i,j,n;
long nr=1;
scanf("%d",&n);
for (i = 3; i <= n; i += 2)
if (p[i] == 0) {
nr++;
for (j = i + i + i; j <= n; j += i << 1)
p[j] = 1;
}
printf("%ld\n\n\n",nr);
return 0;
}