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

Revision en2, by 5002ryx, 2021-10-01 06:23:56

https://mirror.codeforces.com/contest/1580/submission/130368106

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

QAQ

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English 5002ryx 2021-10-01 15:49:50 6
en3 English 5002ryx 2021-10-01 13:53:40 149
en2 English 5002ryx 2021-10-01 06:23:56 0 (published)
en1 English 5002ryx 2021-10-01 06:23:29 262 Initial revision (saved to drafts)