Cod sursa(job #2544053)
| Utilizator | Data | 11 februarie 2020 18:46:19 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
using namespace std;
#define fisier "ciur"
#ifdef fisier
#include <fstream>
ifstream in(fisier ".in");
ofstream out(fisier ".out");
#else
#include <iostream>
#define in cin
#define out cout
#endif
bool v[2000001];
int n, s;
void build() {
int i, j, np2 = n/2, npi;
for (i = 2; i <= np2; i++) {
if (v[i] == 0) {
s++;
for (j = i+i; j <= n; j+=i) {
v[j] = 1;
}
}
}
}
int main() {
in >> n;
build();
out << s;
}
