Cod sursa(job #1459033)
Utilizator | Data | 9 iulie 2015 00:02:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
int primes(int n){
int i,j, count = 1;
char p[n] = {0};
for(i = 3; i <= n; ++i){
if(p[i] == 0){
count++;
for(j = 2 * i; j <= n; j += i){
p[j] = 1;
}
}
}
return count;
}
int main(){
FILE *fi = fopen("ciur.in","r");
FILE *fo = fopen("ciur.out","w");
int n;
fscanf(fi,"%d",&n);
fprintf(fo, "%d", primes(n));
return 0;
}