Warp wrote:
> So the task is simple: Write a function f(m,n) which tells how many> rectangles can be found in an m x n grid. (Explain how you came up> with the function).
You mean just something like n*m*(n-1)*(m-1)/4? The derivation is
pretty direct from the one-dimensional case.
