Cod sursa(job #2764825)
Utilizator | Data | 22 iulie 2021 19:37:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
bool a[2000001];
int main()
{
int n;
f >> n;
for (int i = 2; i <= n/2; i++)
{
if (a[i] == 0)
{
for (int j = 2*i; j <= n; j += i)
{
a[j] = 1;
}
}
}
int contor = 0;
for (int i = 2; i <= n; i++)
{
if (a[i] == 0)
{
contor++;
}
}
g << contor;
}