Cod sursa(job #2758851)
| Utilizator | Data | 13 iunie 2021 16:57:48 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <vector>
using namespace std;
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int N;
cin >> N;
vector<bool> prim(N + 1, true);
int result = 1;
for(int div = 3; div <= N; div +=2)
if(prim[div] == true){
++result;
if((long long)div * div <= N)
for(int i = div * div; i <= N; i += div)
prim[i] = false;
}
cout << result;
cin.close();
cout.close();
return 0;
}