Cod sursa(job #2240437)
Utilizator | Data | 13 septembrie 2018 12:56:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, cnt;
char prim[2000005];
int main()
{
int i, j;
fin >> n;
for (i = 2; i <= n; ++i)
prim[i] = 1;
for (i = 2; i <= n; ++i)
if (prim[i])
{
++cnt;
for (j = i+i; j <= n; j += i)
prim[j] = 0;
}
fout << cnt;
fout << endl;
return 0;
}