Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

How do I solve weird problems

Revision en1, by _blub, 2026-11-06 20:06:50

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, (I'm not sure if there's any other ways to solve but from many sources they all have the same idea as mine) 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?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English _blub 2026-11-07 05:12:36 80 (published)
en1 English _blub 2026-11-06 20:06:50 700 Initial revision (saved to drafts)