Cod sursa(job #2064081)
Utilizator | Data | 11 noiembrie 2017 19:28:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,d, j,nr=0;
char ciur[2000005];
int main()
{
fin>>n;
for (d = 2; d <= n; ++d)
ciur[d] = 1;
for (d = 2; d <= n; ++d)
if (ciur[d])
{
++nr;
for (j = d+d; j <= n; j += d)
ciur[j] = 0;
}
fout << nr;
return 0;
}