2008 OIM Problems/Problem 1

Problem

Numbers $1, 2, 3, \cdots , 2008^2$ were distributed on a $2008 \times 2008$ board, such that in each box there is a different number. For each row and each column of the board, the difference between the largest and smallest of its elements is calculated. Let $S$ be the sum of the 4016 numbers obtained. Determine the largest possible value of $S$.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions