Cod sursa(job #2858270)
| Utilizator | Data | 27 februarie 2022 12:36:15 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000000];
int copac;
int main()
{
int n;
in >> n;
for (int i = 2; i*i <= n; i++)
{
if(!v[i]){
for (int j = 2 * i; j <= n; j += i)
{
v[j] = 1;
}
}
}
for (int i = 2; i <= n; i++)
{
if (!v[i])
{
copac++;
}
}
out << copac;
return 0;
}
