Cod sursa(job #420137)

Utilizator alexandru92alexandru alexandru92 Data 18 martie 2010 16:15:09
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.53 kb
/* 
 * File:   main.cpp
 * Author: virtualdemon
 *
 * Created on March 18, 2010, 3:57 PM
 */
#include <fstream>

/*
 *
 */
using namespace std;
bool is_prime[ 2000010 ];
int main( void )
{
    int N, i, j, k, m, nr;
    ifstream in( "ciur.in" );
    in>>N;
    for( i=2; i*i <= N; ++i )
        if( false == is_prime[i] )
            for( j=2; j*i <= N; ++j )
                is_prime[j*i]=true;
    for( nr=0, i=2; i <= N; ++i )
        if( false == is_prime[i] )
            ++nr;
    ofstream out( "ciur.out" );
    out<<nr;
    return 0;

}