Cod sursa(job #1823582)

Utilizator 1475369147896537415369Andrei Udriste 1475369147896537415369 Data 6 decembrie 2016 17:20:08
Problema Ciurul lui Eratosthenes Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.44 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 << 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;
        }
    }
}

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

return 0;
}