Cod sursa(job #2609021)
Utilizator | Data | 2 mai 2020 01:31:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int ciur [2000005];
int n;
int main ()
{
fin >> n;
int cnt = n - 1;
for (int i = 2; i * i <= n; i++)
if (!ciur[i])
for (int j = i; j <= n / i; j++)
if (!ciur[i * j])
ciur[i * j] = 1, cnt--;
fout << cnt;
}