Cod sursa(job #1911864)
| Utilizator | Data | 7 martie 2017 22:03:07 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool ciur[1000000];
int main()
{
int n, nr = 1;
ciur[0] = 1;
fin >> n;
for (int i=1; ((i * i) << 1) + (i << 1) <= n; i++)
{
if (!ciur[i])
{
for (int j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= n; j += (i<<1)+1)
ciur[j] = 1;
}
}
for (int i=1; 2 * i + 1 <= n; ++i)
if (ciur[i] == 0) nr++;
fout << nr;
return 0;
}
