Cod sursa(job #144917)

Utilizator TabaraTabara Mihai Tabara Data 28 februarie 2008 09:20:15
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include <stdio.h>

#define in "ciur.in"
#define out "ciur.out"
#define NMAX 2000000

int OK[NMAX], N, nrsol;

int main()
{
    freopen( in, "r", stdin );
    freopen( out, "w", stdout );
    
    scanf( "%d", &N );
    int i, j;
    for ( i = 2; i * i <= N; ++i )
    {
        if ( OK[i] == 0 )
        {
             j = 2;
             while ( i*j <= N )
             {
                   OK[i*j] = 1;
                   j++;
             }
        }
    }
    
    for ( i = 2; i <= N; ++i ) if ( OK[i] == 0 ) nrsol++;
    printf( "%d\n", nrsol );
    if ( nrsol <= 1000 ) 
    {
        for ( i = 2; i <= N; ++i ) 
            if ( OK[i] == 0 ) 
               printf( "%d ", i );           
    }
    else 
    {
         nrsol = 0;
         for ( i = 2; nrsol <= 1000; ++i ) 
             if ( OK[i] == 0 ) { printf( "%d ", i ); nrsol++; }
    }
    return 0;
}