Cod sursa(job #2566202)

Utilizator viftode4Iftode Vlad viftode4 Data 2 martie 2020 19:29:56
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.64 kb
#include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define ll long long
using namespace std;
ifstream fin( "ciur.in" );
ofstream fout( "ciur.out" );
void fast()
{
    cin.tie( 0 );
    ios_base::sync_with_stdio( 0 );
}
int nr, n;
bool prim[2000005];
int main()
{
    fast();
    fin >> n;

    for( int i = 2; i <= n; i++ )
        prim[i] = 1;

    for( int i = 2; i <= n; i++ )
        if( prim[i] )
            {
                nr++;

                for( int j = 2 * i; j <= n; j += i )
                    prim[j] = 0;
            }

    fout << nr;
    return 0;
}