Cut rectangle in minimum number of squares

Question

I\'m trying to solve the following problem:

A rectangular paper sheet of M*N is to be cut down into squares such that:

1. The paper i

Answer 1

This is essentially classic integer or 0-1 knapsack problem that can be solved using greedy or dynamic programming approach. You may refer to: Solving the Integer Knapsack