Cod sursa(job #1238004)

Utilizator ConstantinPetroviciPetrovici Constantin ConstantinPetrovici Data 5 octombrie 2014 14:02:17
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.45 kb
#include <fstream>
#include <math.h>

using namespace std;

bool prim[2000007];

int main()
{
    ifstream cin("ciur.in");
    ofstream cout("ciur.out");
    int n , nr = 0 ;
    cin>>n;
    for ( int i = 2 ; i <= sqrt(n) ; ++i )
        if ( prim [ i ] == 0 )
        for ( int j = i*i ; j <= n ; j = j+i )
            prim [ j ] = 1 ;
    for ( int i = 2 ; i <= n ; ++i )
        if ( prim [ i ] ==  0 ) nr++ ;
    cout<<nr;
    return 0;
}