Is there an algorithm that solves this problem for any $$$k$$$? https://codeforces.me/problemset/gymProblem/101806/X.
Any complexity is allowed, if it solves the problem for $$$k\leq5$$$ with the original constraints.
Spoiler
→ 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 | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 9 | Proof_by_QED | 130 |
| 9 | AmShZ | 130 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
i_love_sqrt_decomp | 2025-05-05 12:48:24 | 5 | Tiny change: 'g at most O(m) iteration' -> 'g at most $m$ iteration' | |
| en2 |
|
i_love_sqrt_decomp | 2025-05-05 12:48:12 | 32 | Tiny change: 'th problem, which is' -> 'th problem using at most O(m) iterations, which is' | |
| en1 |
|
i_love_sqrt_decomp | 2025-05-05 12:45:19 | 391 | Initial revision (published) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/03/2026 14:51:18 (g2).
Desktop version, switch to mobile version.
Supported by
