Firstly, the phrase "weird" I use is for problems that have a solution where you can't really prove the time complexity with real proof but rather with intuition, estimation... For example problem [2284C2](https://codeforces.me/problemset/problem/2284/C2), (I'm not sure if there's any other ways to solve but from many sources they all have the same idea as mineafter my random guess during the contest which got AC and according to many sources) the solution for k = 2 is to brute force to find the value c that gcd(a, c) = gcd(b, c) = 1. It is said that c will be found after approximately 300 steps which I have no idea why. Can anyone explain the boundary 300 steps in the problem and are there any tips to recognize and solve these weird problems?
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
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/07/2026 05:41:19 (k3).
Desktop version, switch to mobile version.
Supported by
