Cod sursa(job #1895120)

Utilizator AhileGigel Frone Ahile Data 27 februarie 2017 19:52:34
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.42 kb
#include<bits/stdc++.h>
#define in f
#define out g
using namespace std;

ifstream f ("ciur.in");
ofstream g ("ciur.out");

int const maxsize = 2000010;

int n, k;
unordered_map<int, bool> used;

int main() {
    in >> n;
    for (int i = 2; i <= n; i++) {
        if (used[i] == false)
            k++;
        for (int j = i; j <= n; j += i) {
            used[j] = true;
        }
    }
    out << k;
}