Cod sursa(job #1895117)
Utilizator | Data | 27 februarie 2017 19:51:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 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, int> used;
int main() {
in >> n;
for (int i = 2; i <= n; i++) {
if (used[i] == 0)
k++;
for (int j = i; j <= n; j += i) {
used[j]++;
}
}
out << k;
}