Cod sursa(job #2036367)
Utilizator | Data | 10 octombrie 2017 17:08:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int n, cnt;
bool prim[2000010];
int main(void)
{
in >> n;
for (int i = 2; i <= n; i++)
{
if (prim[i] == 0)
{
for (int j = i + i; j <= n; j = j + i)
prim[j] = 1;
cnt++;
}
}
out << cnt;
return 0;
}