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