Cod sursa(job #1798720)

Utilizator priboiraduPriboi Radu Bogdan priboiradu Data 5 noiembrie 2016 13:04:07
Problema Ciurul lui Eratosthenes Scor 100
Compilator c Status done
Runda Arhiva educationala Marime 0.54 kb
#include <stdio.h>
#include <stdlib.h>

char ciur[2000000];

int main() {
    FILE *fin, *fout;
    int n, i, j, c;
    fin = fopen( "ciur.in", "r" );
    fout = fopen( "ciur.out", "w" );
    fscanf( fin, "%d", &n );
    printf( "%d ", ciur[n] );
    for ( i = 2; i * i <= n; i++ )
        if ( ciur[i] == 0 )
            for ( j = i * i; j <= n; j += i )
                ciur[j] = 1;
    c = 0;
    for ( i = 2; i <= n; i++ )
        if ( ciur[i] == 0 )
            c++;
    fprintf( fout, "%d", c );
    fclose( fin );
    fclose( fout );
    return 0;
}