Time limit: 2.0s
Memory limit: 64M
DWITE Online Computer Programming Contest, October 2010, Problem 3
You are given a rectangular floor that is to be tiled with square tiles. The tiles come in a variety of sizes, but they all measure in some power of two: , , , , etc. A space can be tiled with of the smallest tile, but the minimum number of tiles required is only . Refer to the pattern below.
The input will contain 5 lines, a pair of integers , separated by a space.
The output will contain 5 lines, the minimum number of tiles necessary to exactly cover the by space.
10 5 1000 1001 21 13 9999 888 345 1277
14 1358 42 4065 2046
Problem Resource: DWITECreative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported
y'all and your fancy recursion solutions :v :v