Cod sursa(job #2609024)
Utilizator | Data | 2 mai 2020 01:34:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 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 = 0;
for (int i = 2;i <= n;i++)
{
if (!ciur[i])
{
for (int j = i * i;j <= n;j += i)
ciur[j] = 1;
cnt++;
}
}
fout << cnt;
}