Cod sursa(job #2365903)
| Utilizator | Data | 4 martie 2019 17:21:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <vector>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
unsigned int n;
vector<bool> ciur;
int main() {
fin >> n;
ciur = vector<bool>(n + 1, true);
unsigned int counter = 0;
for (unsigned int i = 2; i <= n; i++)
if (ciur[i]) {
counter++;
for (unsigned j = i + i; j <= n; j += i)
ciur[j] = false;
}
fout << counter;
return 0;
}