hi everyone, I hope all of you doing well, I need help with this problem with proof for the solution to understand all the details plz . I was trying to play with the binary representation of the numbers because of the very large constrains of ai but i didn't reach for any valid solution. https://codeforces.me/edu/course/2/lesson/9/2/practice/contest/307093/problem/G
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
.
Notice that $$$gcd[l,r] \geq gcd[l,r+1]$$$, therefore you could binary search the answer by fixing $$$l$$$ and using some range data structure like segment tree or sparse table.
what the complexity of this logic, n*log^3(n)??
$$$nlogn$$$ with sparse table or $$$nlog^{2}n$$$ with segment tree