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

_blub's blog

By _blub, history, 9 hours ago, In English

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 after 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?

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
6 minutes ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by _blub (previous revision, new revision, compare).