Cod sursa(job #2731908)
Utilizator | Data | 28 martie 2021 15:10:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n, nr = 1;
fin>>n;
vector <bool> a(n + 1, true);
for(int i = 3; i<=n; i+=2){
if(a[i] == true){
nr++;
for(long long j = 1ll * i * i; j<=n; j+=i)
a[j] = false;
}
}
fout<<nr;
return 0;
}