# Paper Cut into Minimum Number of Squares

Given a paper of size, A x B. Task is to cut the paper into squares of any size. Find the minimum number of squares that can be cut from the paper.
Examples:

Input : 13 x 29
Output : 9
Explanation :
2 (squares of size 13x13) +
4 (squares of size 3x3) +
3 (squares of size 1x1)=9

Input : 4 x 5
Output : 5
Explanation :
1 (squares of size 4x4) +
4 (squares of size 1x1)

We know that if we want to cut a minimum number of squares from the paper then we would have to cut the largest square possible from the paper first and the largest square will have the same side as the smaller side of the paper. For example, if the paper has the size 13 x 29, then the maximum square will be of side 13. so we can cut 2 square of size 13 x 13 (29/13 = 2). Now remaining paper will have size 3 x 13. Similarly, we can cut the remaining paper by using 4 squares of size 3 x 3 and 3 squares of 1 x 1. So a minimum of 9 squares can be cut from the Paper of size 13 x 29.

Below is the implementation of the above approach.

`// C++ program to find minimum number of squares`

`// to cut a paper.`

`#include<bits/stdc++.h>`

`using` `namespace` `std;`

`// Returns min number of squares needed`

`int` `minimumSquare(` `int` `a, ` `int` `b)`

`{`

` ` `long` `long` `result = 0, rem = 0;`

` ` `// swap if a is small size side .`

` ` `if` `(a < b)`

` ` `swap(a, b);`

` ` `// Iterate until small size side is`

` ` `// greater then 0`

` ` `while` `(b > 0)`

` ` `{`

` ` `// Update result`

` ` `result += a/b;`

` ` `long` `long` `rem = a % b;`

` ` `a = b;`

` ` `b = rem;`

` ` `}`

` ` `return` `result;`

`}`

`// Driver code`

`int` `main()`

`{`

` ` `int` `n = 13, m = 29;`

` ` `cout << minimumSquare(n, m);`

` ` `return` `0;`

`}`

Output:

9

Note that the above Greedy solution doesnâ€™t always produce an optimal result. For example, if the input is 36 x 30, the above algorithm would produce output 6, but we can cut the paper into 5 squares

1. Three squares of size 12 x 12
2. Two squares of size 18 x 18.