Can anynone please give me prove or proper explanation, Why this loop run at most logn time ?
code
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
Why this code run at most logn time ?
Can anynone please give me prove or proper explanation, Why this loop run at most logn time ?
for (int i = 2; i <= n; i++) { // will run O(log n) times at max
if (__gcd(i, n - 1 - i) == 1) {
cout << i << ' ' << n - 1 - i << ' ' << 1 << '\n';
break;
}
}
Название |
---|