Maximum number of squares that can fit in a right angle isosceles triangle
You are given an isosceles (a triangle with at-least two equal sides) right angle triangle with base b, we need to find the maximum number of squares of side m, which can be fitted into given triangle.
Examples:
Input : b = 6, m = 2
Output : 3
Input : b = 4, m = 1
Output : 6
Let’s consider a right angle triangle XYZ, where YZ is the base of triangle. Suppose length of the base is b. If we consider the position of first square with the vertex Y, we will have (b / m-1) squares in the base, and we will be left with another isosceles right angle triangle having base length (b – m).
Illustration :
Let f(b, m) = Number of squares which can be fitted in triangle having base length b.
then f(b, m) = (b / m – 1) + f(b – m, m)
We can calculate f(b) using above recursion, and with use of memoization. Later we can answer each query in O(1) time. We can do it for even and odd numbers separately with the base case if (b < 2 * m) f(b, m) = 0.
The given recursion can be solved as :
f(b, m) = b / m – 1 + f(b – m, m) = b / m – 1 + (b – m) / m – 1 + f(b – 2m, m)
f(b, m) = b / m – 1 + b / m – 2 + f(b – 3m, m) +…+ f(b – (b / m)m, m)
f(b) = b / m – 1 + b / m – 2 + b / m – 3 +…..+ 1 + 0
With conditions, if (b < 2 * m) f(b, m) = 0
f(b) = sum of first (b / m – 1) natural numbers
= (b / m – 1) * (b / m) / 2
This formula can be used to reduce the time complexity upto O(1).
C++
#include<bits/stdc++.h>
using namespace std;
int maxSquare( int b, int m)
{
return (b / m - 1) * (b / m) / 2;
}
int main()
{
int b = 10, m = 2;
cout << maxSquare (b,m);
return 0;
}
|
Java
public class GFG
{
static int maxSquare( int b, int m)
{
return (b / m - 1 ) * (b / m) / 2 ;
}
public static void main(String args[])
{
int b = 10 , m = 2 ;
System.out.println(maxSquare (b,m));
}
}
|
Python3
def maxSquare(b, m):
return (b / m - 1 ) * (b / m) / 2
b = 10
m = 2
print ( int (maxSquare (b,m)))
|
C#
PHP
<?php
function maxSquare( $b , $m )
{
return ( $b / $m - 1) *
( $b / $m ) / 2;
}
$b = 10; $m = 2;
echo maxSquare( $b , $m );
?>
|
Javascript
<script>
function maxSquare(b, m)
{
return (b / m - 1) * (b / m) / 2; a
}
let b = 10, m = 2;
document.write(maxSquare (b,m));
</script>
|
Output:
10
Time complexity: O(1)
Auxiliary Space: O(1)
Last Updated :
16 Jun, 2022
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...