Problem

Source: 2007 Peru Iberoamerican TST Problem 4

Tags: combinatorics, Tables, board



Each of the squares on a $15$×$15$ board has a zero. At every step you choose a row or a column, we delete all the numbers from it and then we write the numbers from $1$ to $15$ in the empty cells, in an arbitrary order. find the sum possible maximum of the numbers on the board that can be achieved after a number finite number of steps.