Cod sursa(job #1846463)
| Utilizator | Data | 12 ianuarie 2017 21:14:44 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fi ("ciur.in");
ofstream fo ("ciur.out");
int N, c;
bool fr[2000000];
int main()
{
fi >> N;
for (int i = 2; i <= N; ++i)
{
if (!fr[i])
{
++c;
for (int j = 2; i*j <= N; ++j)
fr[j*i]++;
}
}
fo << c;
return 0;
}
