AtCoder Regular Contest 159 Announcement

We will hold AtCoder Regular Contest 159.

The point values will be 300-400-500-600-900-900.

We are looking forward to your participation!

• 8 hours ago, # ^ | Nice round! I can get a large positive delta this time. Wrote a strange solution of B and it passed quickly. Idk whether it's right or weak data.

  • 8 hours ago, # ^ | Ok. It's .

• 5 hours ago, # ^ |

• 10 hours ago, # ^ | 我要掉大粪的

  • 9 hours ago, # ^ | 《落坨翔子》

• 8 hours ago, # ^ | My code is giving TLE after some test cases, could you please look once and optimize it? code

  • 7 hours ago, # ^ | you are manually performing the operations, ofcourse it will give TLE

• 7 hours ago, # ^ | ← Rev. 3 →   0 Let . Suppose . is equivalent to . Then, you can assume coprime. Goal: get a (it's enough to find it times, because you are halving every time). Let . While are coprime, you subtract from both, so you get (). Recall that, when are not coprime, . So, you have to find the maximum such that . So, must be multiple of some prime that divides . Find such primes in . Then, the candidate are the .