Given a paper of size L x W, cut the paper into squares of any size and the count of the squares should be minimum.
Input: 4 x 5
1 (squares of size 4x4) +
4 (squares of size 1x1)
Think that if we want to cut minimum number of squares from the paper then we would have to cut largest square possible from the paper first and largest possible square will contain the side as smaller side of the paper. Same operation will perform recursively on remaining paper.