| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 163 |
| 2 | adamant | 161 |
| 2 | maomao90 | 161 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 151 |
| 6 | nor | 149 |
| 7 | SecondThread | 147 |
| 7 | atcoder_official | 147 |
| 9 | TheScrasse | 146 |
| 10 | Petr | 144 |
Need help in calculating complexity of given code
https://mirror.codeforces.com/contest/1920/problem/C
Above is the link to the problem i need help with. How is the complexity of inner loop n+logn and not n*logn? GCD is being calculated inside the loop so the logarithmic term should be multiplied right?
Link of the given tutorial:-
