Please give me some hint to solve this problem: https://codeforces.me/gym/102769/problem/G
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | maspy | 150 |
| 3 | Um_nik | 144 |
| 4 | nik_exists | 139 |
| 4 | Errichto | 139 |
| 6 | adamant | 136 |
| 7 | maroonrk | 134 |
| 8 | DNR | 132 |
| 9 | AmShZ | 131 |
| 10 | Dominater069 | 129 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/05/2026 11:17:36 (g2).
Desktop version, switch to mobile version.
Supported by
A couple of hints:
the limits look daunting. Is there a special case you can treat separately which will make the limits less daunting?
consider how we might identify ranges of integers [L,R] such that for L <= x <= R, floor(kth root(x)) = Q, for some integer Q. If we iterate over Q, how would that range [L,R] contribute to the answer?