Can anyone hack or prove the greedy solution of 1580D?

Правка en3, от 5002ryx, 2021-10-01 13:53:40

https://codeforces.ml/contest/1580/submission/130368106

The main idea is to choose the most optimal one number in every step.

UPD: To avoid unnecessary inconvenience, if you want to see a cute comic, click here , and please try to solve my problem.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский 5002ryx 2021-10-01 15:49:50 6
en3 Английский 5002ryx 2021-10-01 13:53:40 149
en2 Английский 5002ryx 2021-10-01 06:23:56 0 (published)
en1 Английский 5002ryx 2021-10-01 06:23:29 262 Initial revision (saved to drafts)