Topcoder SRM 489, D2, 500-point problem

• Problem description: http://community.topcoder.com/stat?c=problem_statement&pm=11191&rd=14242
• Solution skeleton: BuyingFlowers.cpp
• Main: Main.cpp

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:

• An enumeration. You'll need to enumerate all potential combinations of seed packets. That is a power set enumeration. Do it with bit arithmetic.

• When you have a combination of packets, you have to decide whether they can make a rectangle, and what the largest such rectangle is. You can do that by running through each value of R from 1 until R*R is greater than the number of seeds, and determining if you can make a rectangle with R rows.