Cod sursa(job #1823580)

Utilizator 1475369147896537415369Andrei Udriste 1475369147896537415369 Data 6 decembrie 2016 17:17:02
Problema Ciurul lui Eratosthenes Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.49 kb
#include <stdio.h>

int main(){

FILE *file1, *file2;
int N, i, j, primes = 1;
char list[2000005];

memset(list, 1, 2000005);

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]){
        ++primes;
        for(j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= N; j += (i << 1) + 1){
            list[j] = 0;
        }
    }
}

fprintf(file2, "%d", primes);

return 0;
}