Given a rectangle of sides m and n. Cut the rectangle into smaller identical pieces such that each piece is a square having maximum possible side length with no leftover part of the rectangle. Print number of such squares formed.
Input: 9 6 Output: 6 Rectangle can be cut into squares of size 3. Input: 4 2 Output: 2 Rectangle can be cut into squares of size 2.
Approach: The task is to cut the rectangle in squares with the side of length s without pieces of the rectangle left over, so s must divide both m and n. Also, the side of the square should be maximum possible, therefore, s should be the greatest common divisor of m and n.
so, s = gcd(m, n).
To find the number of squares the rectangle is cut into, the task to be done is to divide the area of a rectangle with an area of the square of size s.
- Maximum area of rectangle possible with given perimeter
- Count number of squares in a rectangle
- Number of squares of side length required to cover an N*M rectangle
- Determine the number of squares of unit area that a given line will pass through.
- Ratio of area of a rectangle with the rectangle inscribed in it
- Minimum squares to cover a rectangle
- Minimum squares to evenly cut a rectangle
- Maximum number of 2x2 squares that can be fit inside a right isosceles triangle
- Maximum number of squares that can fit in a right angle isosceles triangle
- Area and Perimeter of Rectangle in PL/SQL
- Sum of Area of all possible square inside a rectangle
- Program for Area And Perimeter Of Rectangle
- Area of the biggest ellipse inscribed within a rectangle
- Find minimum area of rectangle with given set of coordinates
- Area of largest triangle that can be inscribed within a rectangle
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.