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
Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 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 | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 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: Nov/07/2026 03:18:50 (g2).
Desktop version, switch to mobile version.
Supported by
