Cod sursa(job #163419)
Utilizator | Data | 22 martie 2008 10:36:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
int prim(long x){
int i;
for(i = 2; i < x / 2 + 1; i++)
if(x % i == 0) return 0;
return 1;
}
int main(){
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
long n, i; scanf("%ld", &n); n++; int rezultat = 1;
for(i = 3; i < n; i += 2)
if(prim(i)) rezultat++;
printf("%d", rezultat);
return 0;
}