Cod sursa(job #2633597)
Utilizator | Data | 7 iulie 2020 21:13:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main() {
int v[2000001] = { 0 };
int N;
fin >> N;
int contor = N - 2 + 1;
for (int i = 2; i * i <= N ; i++)
{
for (int j = i + i; j <= N; j = j+i)
if (j % i == 0)
{
if(v[j] == 0)
contor--;
v[j] = 1;
}
}
fout << contor;
return 0;
}