It has been a while. Consider array A[1..n,1..n] such that any rectangle A[i...j,k...l] has at least one element that appears exactly once in the rectangle. What is the smallest number distinct elements A can have?
books, stories, poems, algorithms, math and computer science. some art and anecdotes too.