Given a rectangle with length **l** and breadth **b**, we need to find the minimum number of squares that can cover the surface of the rectangle, given that each square has a side of length **a**. It is allowed to cover the surface larger than the rectangle, but the rectangle has to be covered. It is not allowed to break the square.

**Examples:**

Input : 1 2 3 Output :1 We have a 3x3 square and we need to make a rectangles of size 1x2. So we need only square to cover the rectangle. Input : 11 23 14 Output :2

The only way to actually fill the rectangle optimally is to arrange each square such that it is parallel to the sides of the rectangle.So we just need to find the number of squares to fully cover the length and breadth of the rectangle.

The length of the rectangle is **l**, and if the side length of the square is **a** divides **l**, then there must be **l/a** squares to cover the full length of **l**. If **l** isn’t divisible by **a**, we need to add **1** to **l/a**, to round it down.For this we can use the **ceil function**, as ceil(x) returns the least integer which is above or equal to x.

We can do the same with the rectangle width, and take the number of squares across the width to be **ceil(b/a)**.

So, total number of squares=**ceil(m/a) * ceil(n/a)**.

## C++

`// C++ program to find the minimum number ` `// of squares to cover the surface of the ` `// rectangle with given dimensions ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` `int` `squares(` `int` `l, ` `int` `b, ` `int` `a) ` `{ ` ` ` `// function to count ` ` ` `// the number of squares that can ` ` ` `// cover the surface of the rectangle ` ` ` `return` `ceil` `(l / (` `double` `)a) * ` `ceil` `(b / (` `double` `)a); ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `l = 11, b = 23, a = 14; ` ` ` `cout << squares(l, b, a) << endl; ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find the minimum number ` `// of squares to cover the surface of the ` `// rectangle with given dimensions ` `class` `GFG ` `{ ` `static` `int` `squares(` `int` `l, ` `int` `b, ` `int` `a) ` `{ ` ` ` `// function to count ` `// the number of squares that can ` `// cover the surface of the rectangle ` `return` `(` `int` `)(Math.ceil(l / (` `double` `)a) * ` ` ` `Math.ceil(b / (` `double` `)a)); ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` `int` `l = ` `11` `, b = ` `23` `, a = ` `14` `; ` ` ` `System.out.println(squares(l, b, a)); ` `} ` `} ` ` ` `// This code is contributed by ChitraNayal ` |

*chevron_right*

*filter_none*

## Python 3

`# Python3 program to find the minimum number ` `# of squares to cover the surface of the ` `# rectangle with given dimensions ` `import` `math ` ` ` `def` `squares(l, b, a): ` ` ` ` ` `# function to count ` ` ` `# the number of squares that can ` ` ` `# cover the surface of the rectangle ` ` ` `return` `math.ceil(l ` `/` `a) ` `*` `math.ceil(b ` `/` `a) ` ` ` `# Driver code ` `if` `__name__ ` `=` `=` `"__main__"` `: ` ` ` `l ` `=` `11` ` ` `b ` `=` `23` ` ` `a ` `=` `14` ` ` `print` `(squares(l, b, a)) ` ` ` `# This code is contributed ` `# by ChitraNayal ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find the minimum number ` `// of squares to cover the surface of the ` `// rectangle with given dimensions ` `using` `System; ` ` ` `class` `GFG ` `{ ` `static` `int` `squares(` `int` `l, ` `int` `b, ` `int` `a) ` `{ ` ` ` `// function to count ` `// the number of squares that can ` `// cover the surface of the rectangle ` `return` `(` `int` `)(Math.Ceiling(l / (` `double` `)a) * ` ` ` `Math.Ceiling(b / (` `double` `)a)); ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main() ` `{ ` ` ` `int` `l = 11, b = 23, a = 14; ` ` ` `Console.Write(squares(l, b, a)); ` `} ` `} ` ` ` `// This code is contributed by ChitraNayal ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP program to find the minimum number ` `// of squares to cover the surface of the ` `// rectangle with given dimensions ` ` ` `function` `squares(` `$l` `, ` `$b` `, ` `$a` `) ` `{ ` ` ` `// function to count ` ` ` `// the number of squares that can ` ` ` `// cover the surface of the rectangle ` ` ` `return` `ceil` `(` `$l` `/ (double)` `$a` `) * ` ` ` `ceil` `(` `$b` `/ (double)` `$a` `); ` `} ` ` ` `// Driver code ` `$l` `= 11; ` `$b` `= 23; ` `$a` `= 14; ` `echo` `squares(` `$l` `, ` `$b` `, ` `$a` `); ` ` ` `// This code is contributed ` `// by ChitraNayal ` `?> ` |

*chevron_right*

*filter_none*

**Output:**

2

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Number of squares of side length required to cover an N*M rectangle
- Minimum squares to evenly cut a rectangle
- Count number of squares in a rectangle
- Number of squares of maximum area in a rectangle
- Minimum lines to cover all points
- Minimum cost to cover the given positions in a N*M grid
- Minimum distance to travel to cover all intervals
- Minimum time required to cover a Binary Array
- Minimum number of points required to cover all blocks of a 2-D grid
- Minimum steps needed to cover a sequence of points on an infinite grid
- Find minimum area of rectangle with given set of coordinates
- Rectangle with minimum possible difference between the length and the width
- Paper Cut into Minimum Number of Squares
- Largest subset of rectangles such that no rectangle fit in any other rectangle
- Ratio of area of a rectangle with the rectangle inscribed in it
- Minimum number of squares whose sum equals to given number N | set 2
- Minimum number of squares whose sum equals to a given number N | Set-3
- Minimum number of squares whose sum equals to given number n
- Count number of ways to cover a distance | Set 2
- Program to Calculate the Edge Cover of a Graph

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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.