Cod sursa(job #2704847)
Utilizator | Data | 11 februarie 2021 14:50:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#define Nmax 2000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ct;
bool w[Nmax];
void Ciur(int n)
{
w[0] = w[1] = true;
for(int i = 2; i <= n; ++ i)
{
if(!w[i])
{
ct ++;
for(int j = i; j <= n; j ++)
w[i * j] = true;
}
}
}
int main()
{
int n;
fin >> n;
Ciur(n);
cout << ct;
return 0;
}