Cod sursa(job #2717753)
Utilizator | Data | 7 martie 2021 21:33:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 2000000;
int N;
char v[1 + NMAX];
int nr;
int main()
{
ifstream fin("ciur.in");
ofstream fou("ciur.out");
fin >> N;
for(int i = 2; i <= N; i++)
{
if(v[i] == 0)
{
nr ++;
for(int j = 2 * i; j <= N; j += i)
v[j] = 1;
}
}
fou << nr;
return 0;
}