Cod sursa(job #2362398)
| Utilizator | Data | 3 martie 2019 10:35:02 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 5;
bool a[maxn];
int main() {
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n;
cin >> n;
int nr = 0;
for(int i = 2;i <= n;i++) {
if(a[i] == 0) {
nr++;
for(long long j = 1LL * i * i;j <= n;j += 1LL * i) {
a[j] = 1;
}
}
}
cout << nr;
return 0;
}
