Cod sursa(job #387397)
Utilizator | Data | 27 ianuarie 2010 15:52:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
#define N 2000100
bool v[N];
int 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])){
nr++;
for (j = 2 ,nmax = n/i; j <= nmax; j++)
v[j*i] = 1;
}
}
printf("%d", nr);
return 0;
}