I have been unable to solve the question in this image. the most concerning part is k can be as large as 10^14 which doesn't give much options how to traverse and apply the logic. Please provide me a good approach to solve this
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3857 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | -is-this-fft- | 161 |
| 3 | Qingyu | 160 |
| 4 | Dominater069 | 158 |
| 5 | atcoder_official | 157 |
| 6 | adamant | 154 |
| 7 | Um_nik | 151 |
| 8 | djm03178 | 150 |
| 9 | luogu_official | 149 |
| 10 | awoo | 147 |
→ Find user
→ Recent actions
How to solve this question ? Here n<=10^5 and k<=10^14
Revision en1, by setsuna_780, 2024-04-07 19:16:25
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
setsuna_780 | 2024-04-07 19:17:19 | 838 | ||
| en1 |
|
setsuna_780 | 2024-04-07 19:16:25 | 281 | Initial revision (published) |
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Mar/10/2025 17:34:49 (j1).
Desktop version, switch to mobile version.
Supported by
