Cod sursa(job #2718604)
Utilizator | Data | 8 martie 2021 21:17:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int a[2000000];
void Ciur(int n)
{
int nr = 0;
for (int i = 4; i <= n; i += 2)
{
nr++;
a[i] = 1;
}
for (int i = 3; i*i <= n; i += 2)
if (a[i] == 0)
for (int j = i*i; j <= n; j += 2*i)
{
nr++;
a[j] = 1;
}
fout << n - nr - 1;
}
int main()
{
int n;
fin >> n;
Ciur(n);
fin.close();
fout.close();
return 0;
}