Topcoder SRM 489, D2, 500-point problem

James S. Plank
September, 2013

This file just contains hints. Please see this file for more detailed lecture notes.

Think about this problem a bit. It has a few components:

So, basically, this is a two-phase enumeration -- enumerate all potential combinations of seed packets, and then enumerate all potential numbers of rows in a rectangle.