bully....maguire's blog

Proof of a problem statement in Goodbye 2019

By bully....maguire, history, 5 years ago, In English

In goodbye 2019 problem G , it is mentioned that suppose an array with n elements is given such that each element a_i is from (i-n) to (i-1) then there exist subset of the array whose sum is zero . How to prove it ?

  • Vote: I like it
  • -41
  • Vote: I do not like it

»
5 years ago, # |
  Vote: I like it +30 Vote: I do not like it

Well, read the editorial. The existence of a solution is proof of your lemma.

→ Reply