Cod sursa(job #2640004)
| Utilizator | Data | 4 august 2020 17:33:00 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n, num = 1;
bool ciur[1000000] = {0};
cin >> n;
for (int i = 1; ((i << 1) + 1) * ((i << 1) + 1) <= n; ++i)
if(ciur[i] == 0)
{
for (int j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= n; j += (i << 2) + 4)
ciur[j] = true;
}
for (int i = 1; (i << 1) + 1 <= n; ++i)
if (ciur[i] == 0)
++num;
cout << num;
return 0;
}