Cod sursa(job #2374779)

Utilizator annecojocaruAnne-Marie-Zoe Cojocaru annecojocaru Data 7 martie 2019 20:26:24
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.55 kb
#include <iostream>
#include <cstdio>

using namespace std;

int main()
{
    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);
    int n, prim = 0;
    bool nr[2000001];
    scanf("%d", &n);
    for(int i = 2; i <= n; i++)
    {
        nr[i] = true;
    }
    for(int j = 2; j <= n; j++)
    {
        if(nr[j])
        {
            prim++;
            for(int k = 2 * j; k <= n; k += j)
            {
                nr[k] = false;
            }
        }
    }
    printf("%d\n", prim);
    return 0;

}