Proof of a problem statement in Goodbye 2019

Revision en1, by bully....maguire, 2020-01-01 20:51:24

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 ?

Tags #help, good bye 2019

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English bully....maguire 2020-01-01 20:51:24 309 Initial revision (published)