Each entry in a $2000\times 2000$ array is $0$, $1$, or $-1$. Show that it's possible for all $4000$ row sums and column sums to be distinct.
Problem
Source: XII Cono Sur Mathematical Olympiad (2001)
Tags: combinatorics unsolved, combinatorics
Source: XII Cono Sur Mathematical Olympiad (2001)
Tags: combinatorics unsolved, combinatorics
Each entry in a $2000\times 2000$ array is $0$, $1$, or $-1$. Show that it's possible for all $4000$ row sums and column sums to be distinct.