Skip to content
Related Articles

Related Articles

Maximum count of Equilateral Triangles that can be formed within given Equilateral Triangle
  • Difficulty Level : Expert
  • Last Updated : 23 Mar, 2021

Given two integers N and K where N denotes the unit size of a bigger Equilateral Triangle, the task is to find the number of an equilateral triangle of size K that are present in the bigger triangle of side N.

Examples:

Input: N = 4, K = 3

Output: 3
Explanation:
There are 3 equilateral triangles of 3 unit size which are present in the Bigger equilateral triangle of size 4 units.



Input: N = 4, K = 2
Output: 7
Explanation:
There are 7 equilateral triangles of 2 unit size which are present in the Bigger equilateral triangle of size 4 units. 

Naive Approach: The idea is to iterate over all possible sizes of the bigger equilateral triangle for checking the number of triangles with the required size K and print the total count of triangles.

Time Complexity: O(N)
Auxiliary Space: O(1)

Efficient Approach: To optimize the above approach, observe the following points:

  • The number of triangles with a peak in the upward direction of size K present in size N equals to ((N – K +1 ) * (N – K + 2))/2.
  • The number of inverted triangles with a peak in the downward direction of size K present in size N equals to ((N – 2K + 1) * (N – 2K + 2))/2.

Below is the implementation of the above approach:

C++




// C++ program for the above approach
#include <iostream>
using namespace std;
 
// Function to find the number of
// equilateral triangle formed
// within another triangle
int No_of_Triangle(int N, int K)
{
    // Check for the valid condition
    if (N < K)
        return -1;
 
    else {
 
        int Tri_up = 0;
 
        // Number of triangles having
        // upward peak
        Tri_up = ((N - K + 1)
                  * (N - K + 2))
                 / 2;
 
        int Tri_down = 0;
 
        // Number of inverted triangles
        Tri_down = ((N - 2 * K + 1)
                    * (N - 2 * K + 2))
                   / 2;
 
        // Total no. of K sized triangle
        return Tri_up + Tri_down;
    }
}
 
// Driver Code
int main()
{
    // Given N and K
    int N = 4, K = 2;
 
    // Function Call
    cout << No_of_Triangle(N, K);
    return 0;
}
Java



// Java program for the above approach
import java.util.*;
class GFG{
 
// Function to find the number of
// equilateral triangle formed
// within another triangle
static int No_of_Triangle(int N, int K)
{
    // Check for the valid condition
    if (N < K)
        return -1;
 
    else
    {
        int Tri_up = 0;
 
        // Number of triangles having
        // upward peak
        Tri_up = ((N - K + 1) * (N - K + 2)) / 2;
 
        int Tri_down = 0;
 
        // Number of inverted triangles
        Tri_down = ((N - 2 * K + 1) *
                    (N - 2 * K + 2)) / 2;
 
        // Total no. of K sized triangle
        return Tri_up + Tri_down;
    }
}
 
// Driver Code
public static void main(String[] args)
{
    // Given N and K
    int N = 4, K = 2;
 
    // Function Call
    System.out.print(No_of_Triangle(N, K));
}
}
 
// This code is contributed by PrinciRaj1992
Python3



# Python3 program for the above approach
 
# Function to find the number of
# equilateral triangle formed
# within another triangle
def No_of_Triangle(N, K):
   
    # Check for the valid condition
    if (N < K):
        return -1;
 
    else:
        Tri_up = 0;
 
        # Number of triangles having
        # upward peak
        Tri_up = ((N - K + 1) *
                  (N - K + 2)) // 2;
 
        Tri_down = 0;
 
        # Number of inverted triangles
        Tri_down = ((N - 2 * K + 1) *
                    (N - 2 * K + 2)) // 2;
 
        # Total no. of K sized triangle
        return Tri_up + Tri_down;
     
# Driver Code
if __name__ == '__main__':
    # Given N and K
    N = 4; K = 2;
 
    # Function Call
    print(No_of_Triangle(N, K));
 
# This code is contributed by sapnasingh4991
C#



// C# program for the above approach
using System;
class GFG{
 
// Function to find the number of
// equilateral triangle formed
// within another triangle
static int No_of_Triangle(int N, int K)
{
    // Check for the valid condition
    if (N < K)
        return -1;
 
    else
    {
        int Tri_up = 0;
 
        // Number of triangles having
        // upward peak
        Tri_up = ((N - K + 1) * (N - K + 2)) / 2;
 
        int Tri_down = 0;
 
        // Number of inverted triangles
        Tri_down = ((N - 2 * K + 1) *
                    (N - 2 * K + 2)) / 2;
 
        // Total no. of K sized triangle
        return Tri_up + Tri_down;
    }
}
 
// Driver Code
public static void Main(String[] args)
{
    // Given N and K
    int N = 4, K = 2;
 
    // Function Call
    Console.Write(No_of_Triangle(N, K));
}
}
 
// This code is contributed by Rajput-Ji
Javascript



<script>
 
// JavaScript program for the above approach
 
// Function to find the number of
// equilateral triangle formed
// within another triangle
function No_of_Triangle(N, K)
{
    // Check for the valid condition
    if (N < K)
        return -1;
 
    else {
 
        let Tri_up = 0;
 
        // Number of triangles having
        // upward peak
        Tri_up = Math.floor(((N - K + 1)
                * (N - K + 2))
                / 2);
 
        let Tri_down = 0;
 
        // Number of inverted triangles
        Tri_down = Math.floor(((N - 2 * K + 1)
                    * (N - 2 * K + 2))
                / 2);
 
        // Total no. of K sized triangle
        return Tri_up + Tri_down;
    }
}
 
// Driver Code
 
    // Given N and K
    let N = 4, K = 2;
 
    // Function Call
    document.write(No_of_Triangle(N, K));
 
 
// This code is contributed by Surbhi Tyagi.
 
</script>
Output: 
7
 
Time Complexity: O(1)
Auxiliary Space: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important mathematical concepts for competitive programming with the Essential Maths for CP Course at a student-friendly price. To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.
My Personal Notes
arrow_drop_up
Next

Largest hexagon that can be inscribed within a square
Recommended Articles
Page :
Largest square that can be inscribed within a hexagon which is inscribed within an equilateral triangle
10, Jan 19
Biggest Reuleaux Triangle inscribed within a Square inscribed in an equilateral triangle
17, Jan 19
Biggest Reuleaux Triangle within a Square which is inscribed within a Right angle Triangle
11, Jan 19
Biggest Square that can be inscribed within an Equilateral triangle
14, Jan 19
Largest hexagon that can be inscribed within an equilateral triangle
27, Dec 18
Biggest Reuleaux Triangle within a Square which is inscribed within a Circle
11, Jan 19
Biggest Reuleaux Triangle inscribed within a square which is inscribed within a hexagon
21, Jan 19
Biggest Reuleaux Triangle inscribed within a square which is inscribed within an ellipse
21, Jan 19
Count of Equilateral Triangles of unit length possible from a given Hexagon
19, Aug 20
Largest right circular cylinder that can be inscribed within a cone which is in turn inscribed within a cube
11, Jan 19
Largest right circular cone that can be inscribed within a sphere which is inscribed within a cube
21, Jan 19
Largest sphere that can be inscribed within a cube which is in turn inscribed within a right circular cone
19, Mar 19
Largest ellipse that can be inscribed within a rectangle which in turn is inscribed within a semicircle
10, Apr 19
Number of triangles that can be formed with given N points
07, Dec 18
Number of Triangles that can be formed given a set of lines in Euclidean Plane
07, Jul 17
Maximum area of rectangle inscribed in an equilateral triangle
27, Mar 20
Count of distinct rectangles inscribed in an equilateral triangle
10, May 19
Calculate ratio of area of a triangle inscribed in an Ellipse and the triangle formed by corresponding points on auxiliary circle
01, Apr 21
Area of largest triangle that can be inscribed within a rectangle
15, Oct 18
Program to calculate area and perimeter of equilateral triangle
05, Dec 17
Program to calculate the Area and Perimeter of Incircle of an Equilateral Triangle
27, Nov 18
Area of a square inscribed in a circle which is inscribed in an equilateral triangle
15, Oct 18
Program to calculate area of Circumcircle of an Equilateral Triangle
10, Mar 18
Area of circle which is inscribed in equilateral triangle
23, Oct 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
thakurabhaysingh445
@thakurabhaysingh445
Vote for difficulty
Current difficulty :
Expert





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox