Cod sursa(job #2918338)
| Utilizator | Data | 11 august 2022 11:19:49 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
std::ifstream fin("ciur.in");
std::ofstream fout("ciur.out");
int main() {
int n{ 0 };
int nr{ 1 };
fin >> n;
vector<int> check_if_visited(n + 1, 0);
for (int i = 3; i <= n; i+=2)
{
if (check_if_visited[i] == 0)
{
for (int j = 2; j * i <= n; j++)
{
check_if_visited[j * i] = 1;
}
nr++;
}
}
fout << nr;
return 0;
}