Cod sursa(job #2064415)
Utilizator | Timur Cadir Timur_Cadir | Data | 12 noiembrie 2017 12:30:08 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
using namespace std;
bool ciur[2000000];
int main()
{
ifstream cin ("ciur.in");
ofstream cout ("ciur.out");
int n, i, prim, j;
cin >> n;
for (i = 2; i <= n; i++)
ciur[i] = true;
for (i = 2; i <= n; i++)
{
if (ciur[i] == true)
for (j = i * 2; j <= n; j += i)
ciur[j] = false;
}
prim = 0;
for (i = 2; i <= n; i++)
{
if (ciur[i] == true)
prim++;
}
cout << prim;
return 0;
}