What is the maximum number of squares of size 2×2 units that can be fit in a right-angled isosceles triangle of a given base (in units).

A side of the square must be parallel to the base of the triangle.

Examples:

Input : 8 Output : 6 Please refer below diagram for explanation. Input : 7 Output : 3

Since the triangle is isosceles, the given base would also be equal to the height. Now in the diagonal part, we would always need an extra length of 2 units in both height and base of the triangle to accommodate a triangle. (The CF and AM segment of the triangle in the image. The part that does not contribute to any square). In the remaining length of base, we can construct length / 2 squares. Since each square is of 2 units, same would be the case of height, there is no need to calculate that again.

So, for each level of given length we can construct “(length-2)/2” squares. This gives us a base of “(length-2)” above it. Continuing this process to get the no of squares for all available “length-2” height, we can calculate the squares.

while length > 2 answer += (length - 2 )/2 length = length - 2

**For more effective way, we can use the formula of sum of AP n * ( n + 1 ) / 2, where n = length – 2**

## C++

`// C++ program to count number of 2 x 2 ` `// squares in a right isosceles triangle ` `#include<bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `int` `numberOfSquares(` `int` `base) ` `{ ` ` ` `// removing the extra part we would ` ` ` `// always need ` ` ` `base = (base - 2); ` ` ` ` ` `// Since each square has base of ` ` ` `// length of 2 ` ` ` `base = ` `floor` `(base / 2); ` ` ` ` ` `return` `base * (base + 1)/2; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `base = 8; ` ` ` `cout << numberOfSquares(base); ` ` ` `return` `0; ` `} ` `// This code is improved by heroichitesh. ` |

*chevron_right*

*filter_none*

## Java

`// Java program to count number of 2 x 2 ` `// squares in a right isosceles triangle ` ` ` `class` `Squares ` `{ ` ` ` `public` `static` `int` `numberOfSquares(` `int` `base) ` ` ` `{ ` ` ` `// removing the extra part ` ` ` `// we would always need ` ` ` `base = (base - ` `2` `); ` ` ` ` ` `// Since each square has ` ` ` `// base of length of 2 ` ` ` `base = Math.floorDiv(base, ` `2` `); ` ` ` ` ` `return` `base * (base + ` `1` `)/` `2` `; ` ` ` `} ` ` ` ` ` `// Driver code ` ` ` `public` `static` `void` `main(String args[]) ` ` ` `{ ` ` ` ` ` `int` `base = ` `8` `; ` ` ` `System.out.println(numberOfSquares(base)); ` ` ` `} ` `} ` ` ` `// This code is contributed by Anshika Goyal and improved by heroichitesh. ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program to count number ` `# of 2 x 2 squares in a right ` `# isosceles triangle ` `def` `numberOfSquares(base): ` ` ` ` ` `# removing the extra part we would ` ` ` `# always need ` ` ` `base ` `=` `(base ` `-` `2` `) ` ` ` ` ` `# Since each square has base of ` ` ` `# length of 2 ` ` ` `base ` `=` `base ` `/` `/` `2` ` ` ` ` `return` `base ` `*` `(base ` `+` `1` `) ` `/` `2` ` ` `# Driver code ` `base ` `=` `8` ` ` `print` `(numberOfSquares(base)) ` ` ` `# This code is contributed by Anant Agarwal and improved by heroichitesh. ` |

*chevron_right*

*filter_none*

## C#

`// C# program to count number of 2 x 2 ` `// squares in a right isosceles triangle ` `using` `System; ` ` ` `class` `GFG { ` ` ` ` ` `public` `static` `int` `numberOfSquares(` `int` `_base) ` ` ` `{ ` ` ` ` ` `// removing the extra part ` ` ` `// we would always need ` ` ` `_base = (_base - 2); ` ` ` ` ` `// Since each square has ` ` ` `// base of length of 2 ` ` ` `_base = _base / 2; ` ` ` ` ` `return` `_base * (_base + 1)/2; ` ` ` `} ` ` ` ` ` `// Driver code ` ` ` `public` `static` `void` `Main() ` ` ` `{ ` ` ` ` ` `int` `_base = 8; ` ` ` `Console.WriteLine(numberOfSquares(_base)); ` ` ` `} ` `} ` ` ` `// This code is contributed by anuj_67. ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP program to count number of 2 x 2 ` `// squares in a right isosceles triangle ` ` ` ` ` `function` `numberOfSquares( ` `$base` `) ` ` ` `{ ` ` ` ` ` `// removing the extra ` ` ` `// part we would ` ` ` `// always need ` ` ` `$base` `= (` `$base` `- 2); ` ` ` ` ` `// Since each square ` ` ` `// has base of ` ` ` `// length of 2 ` ` ` `$base` `= intdiv(` `$base` `, 2); ` ` ` ` ` `return` `$base` `* (` `$base` `+ 1)/2; ` ` ` `} ` ` ` `// Driver code ` `$base` `= 8; ` `echo` `numberOfSquares(` `$base` `); ` ` ` `// This code is contributed by anuj_67 and improved by heroichitesh. ` `?> ` |

*chevron_right*

*filter_none*

Output:

6

This article is contributed by **Harshit Agrawal**. 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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

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:

- Maximum number of squares that can fit in a right angle isosceles triangle
- Find the altitude and area of an isosceles triangle
- Divide an isosceles triangle in two parts with ratio of areas as n:m
- Find two vertices of an isosceles triangle in which there is rectangle with opposite corners (0, 0) and (X, Y)
- Number of squares of maximum area in a rectangle
- Find a point that lies inside exactly K given squares
- Triangle with no point inside
- Maximum sum of a path in a Right Number Triangle
- Area of a triangle inside a parallelogram
- Count Integral points inside a Triangle
- Check whether a given point lies inside a triangle or not
- Number of Isosceles triangles in a binary tree
- Maximum path sum in a triangle.
- Maximum path sum in an Inverted triangle | SET 2
- Maximum Perimeter Triangle from array
- Maximum area of triangle having different vertex colors
- Maximum height when coins are arranged in a triangle
- Maximum area of rectangle inscribed in an equilateral triangle
- Paper Cut into Minimum Number of Squares
- Number of unique rectangles formed using N unit squares