Cod sursa(job #2036039)
| Utilizator | Data | 10 octombrie 2017 10:32:37 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int N;
in >> N;
vector<bool> is_prime(N + 1, true);
for (int i = 2; i <= N; i++)
{
if (is_prime[i])
{
for (int j = 2 * i; j <= N; j += i)
is_prime[j] = false;
}
}
int count = 0;
for (int i = 2; i <= N; i++)
{
if (is_prime[i]) count++;
}
out << count;
out.close();
in.close();
}