Tous les défis
Difficile 0 résolus 0 % de réussite

Cut a Rectangle Into Squares

Find the fewest straight cuts needed to produce only squares.

On each move, choose one rectangle and cut all the way across it, parallel to a side, making two rectangles with positive integer side lengths. Continue until every piece is a square. Squares may have different sizes. Count cuts, not pieces.

Implement rectangle_cutting(height, width).

Input

height: The starting rectangle height.

width: The starting rectangle width.

Output

Return the minimum number of cuts.

Contraintes

1 ≤ height, width ≤ 500. Rotation does not change the answer.

Exemples

Exemple 1
Entrée :
width = 3
height = 2

Sortie attendue :
expected = 2
Entrée :
long long width = 3;
long long height = 2;

Sortie attendue :
long long expected = 2;
Entrée :
long width = 3;
long height = 2;

Sortie attendue :
long expected = 2;

Explication

Cut off a 2 × 2 square, leaving a 2 × 1 rectangle. One more cut splits the remainder into two unit squares.

Exemple 2
Entrée :
width = 4
height = 4

Sortie attendue :
expected = 0
Entrée :
long long width = 4;
long long height = 4;

Sortie attendue :
long long expected = 0;
Entrée :
long width = 4;
long height = 4;

Sortie attendue :
long expected = 0;

Explication

The starting rectangle is already a square.

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.