Cod sursa(job #1823586)
| Utilizator | Data | 6 decembrie 2016 17:22:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <stdio.h>
char list[2000005];
int main(){
FILE *file1, *file2;
int N, i, j, primes = 1;
file1 = fopen("ciur.in", "r");
file2 = fopen("ciur.out", "w");
fscanf(file1, "%d", &N);
for(i = 1; ((i * i) << 1) + (i << 1) <= N; i += 1){
if(list[i]==0){
for(j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= N; j += (i << 1) + 1){
list[j] = 1;
}
}
}
for (i=1; 2 * i + 1 <= N; ++i){
if (list[i] == 0) primes++;
}
fprintf(file2, "%d", primes);
return 0;
}
