Cod sursa(job #1413836)
Utilizator | Data | 2 aprilie 2015 09:48:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N;
int sol;
bool used[2000005];
void ciur()
{
for (int i = 2; i <= N; ++i)
{
if (!used[i])
{
++sol;
for (int j = 2 * i; j <= N; j += i)
used[j] = true;
}
}
}
int main()
{
fin >> N;
ciur();
fout << sol << '\n';
fin.close();
fout.close();
return 0;
}