5002ryx's blog

Can anyone hack or prove the greedy solution of 1580D?
By 5002ryx, history, 5 years ago, In English

https://mirror.codeforces.com/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.

  • Vote: I like it
  • +43
  • Vote: I do not like it

Comments Comments (6)
| Write comment?
»
5 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
5 years ago, hide # |
 
Vote: I like it +289 Vote: I do not like it

ffs, I can't even browse CF safely in public

→ Reply
»
5 years ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

So basically.. It was a trap

→ Reply
»
5 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
5 years ago, hide # |
← Rev. 2  
Vote: I like it +4 Vote: I do not like it

Is codeforces.ml a trusted domain?

→ Reply