1240. Tiling a Rectangle with the Fewest Squares

中文文档

Description

Given a rectangle of size n x m, find the minimum number of integer-sided squares that tile the rectangle.

Example 1:

3

Example 2:

Input: n = 5, m = 8
Output: 5

Example 3:

Input: n = 11, m = 13
Output: 6

Constraints:

• 1 <= n <= 13
• 1 <= m <= 13

Solutions

Python3

Java

...