Cod sursa(job #3032089)

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

int 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] != 1; ++j) {
            is_prime[i * j] = 1;
        }
    }
    int rez = 0;
    for (int i = 2; i <= n; ++i) {
        if (is_prime[i] != 1) {
            ++rez;
        }
    }
    cout << rez;
  	cout.close();
    return 0;
}