Cod sursa(job #3032094)

Utilizator keepcodingTanase Daniel keepcoding Data 21 martie 2023 14:15:40
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.49 kb
#include <bits/stdc++.h>
using namespace std;

bool is_prime[2000001];

int main() {
	ifstream cin("ciur.in");
  	ofstream cout("ciur.out");
    int n;
    cin >> n;
    for (int i = 2; i * i <= n; ++i) {
        for (int j = i; i * j <= n && !is_prime[i]; ++j) {
            is_prime[i * j] = true;
        }
    }
    int rez = 0;
    for (int i = 2; i <= n; ++i) {
        if (!is_prime[i]) {
            ++rez;
        }
    }
    cout << rez;
  	cout.close();
    return 0;
}