Given an array S[] consisting of the lengths of the 6 sides of a Hexagon, the task is to calculate the number of equilateral triangles of unit length that can be made from the given hexagon.
Examples:
Input: S = {1, 1, 1, 1, 1, 1}
Output: 6
Explanation:
Input: S = {2, 2, 1, 3, 1, 2}
Output: 19
Explanation:
Approach: The following observations need to be made to solve the given problem:
- Consider an equilateral triangle of ‘X’ side length. It has been divided into smaller triangles of unit length each, by drawing lines parallel to its sides.
- Below are the images of three such equilateral triangles:
Example 1: X = 2
Example 2: X = 3
Example 3: X = 5
- In each of the above three examples, the count of unit length equilateral triangles possible are:
- X = 2: 4 equilateral triangles of 1 unit length side.
- X = 3: 9 equilateral triangles of 1 unit length side.
- X = 5: 25 equilateral triangles of 1 unit length side.
- By observation, it is clear that, for an equilateral triangle of side length X, X2 equilateral triangles of unit length are possible.
- Extending this observation to Hexagons, inscribe Hexagons inside the equilateral triangles, as shown below:
A regular Hexagon inscribed from equilateral triangle of side X = 3, has 6 mini triangles inside it.
An irregular Hexagon inscribed from the equilateral triangle of side X = 5, has 19 mini triangles inside it.
- It can be observed that by removing a certain number of mini triangles from the bigger triangle, the hexagon with given dimensions can be found.
The formula for counting the number of triangles of unit length can be generalized for a Hexagon having six sides S1 , S2 , S3 , S4 , S5 , S6 as:
Number of triangles that can be formed = ( S1 + S2 + S3 )2 – S12 – S32 – S52
Below is the implementation of the above approach:
C++
// C++ program to implement// the above approach#include <bits/stdc++.h>using namespace std;// Function to calculate the// the number of Triangles possibleint calculateTriangles(int sides[]){ double count = pow(sides[0] + sides[1] + sides[2], 2); count -= pow(sides[0], 2); count -= pow(sides[2], 2); count -= pow(sides[4], 2); return (int)(count);}// Driver Codeint main(){ // Regular Hexagon int sides[] = { 1, 1, 1, 1, 1, 1 }; cout << (calculateTriangles(sides)) << endl; // Irregular Hexagon int sides1[] = { 2, 2, 1, 3, 1, 2 }; cout << (calculateTriangles(sides1)) << endl; return 0;}// This code is contributed by 29AjayKumar |
Java
// Java program to implement// the above approachimport java.util.*;class GFG{// Function to calculate the// the number of Triangles possiblestatic int calculateTriangles(int sides[]){ double count = Math.pow(sides[0] + sides[1] + sides[2], 2); count -= Math.pow(sides[0], 2); count -= Math.pow(sides[2], 2); count -= Math.pow(sides[4], 2); return (int)(count);}// Driver Codepublic static void main(String[] args){ // Regular Hexagon int sides[] = { 1, 1, 1, 1, 1, 1 }; System.out.print((calculateTriangles(sides)) + "\n"); // Irregular Hexagon int sides1[] = { 2, 2, 1, 3, 1, 2 }; System.out.print((calculateTriangles(sides1)) + "\n");}}// This code is contributed by amal kumar choubey |
Python3
# Python3 Program to implement# the above approach# Function to calculate the # the number of Triangles possibledef calculateTriangles(sides): count = pow( sides[0] + sides[1] + sides[2], 2) count -= pow( sides[0], 2) count -= pow( sides[2], 2) count -= pow( sides[4], 2) return int(count)# Driver Code# Regular Hexagonsides = [1, 1, 1, 1, 1, 1]print(calculateTriangles(sides))# Irregular Hexagonsides = [2, 2, 1, 3, 1, 2]print(calculateTriangles(sides)) |
C#
// C# program to implement// the above approachusing System;class GFG{// Function to calculate the// the number of Triangles possiblestatic int calculateTriangles(int []sides){ double count = Math.Pow(sides[0] + sides[1] + sides[2], 2); count -= Math.Pow(sides[0], 2); count -= Math.Pow(sides[2], 2); count -= Math.Pow(sides[4], 2); return (int)(count);}// Driver Codepublic static void Main(String[] args){ // Regular Hexagon int []sides = { 1, 1, 1, 1, 1, 1 }; Console.Write((calculateTriangles(sides)) + "\n"); // Irregular Hexagon int []sides1 = { 2, 2, 1, 3, 1, 2 }; Console.Write((calculateTriangles(sides1)) + "\n");}}// This code is contributed by amal kumar choubey |
Javascript
<script>// JavaScript program to implement// the above approach// Function to calculate the// the number of Triangles possiblefunction calculateTriangles(sides){ let count = Math.pow(sides[0] + sides[1] + sides[2], 2); count -= Math.pow(sides[0], 2); count -= Math.pow(sides[2], 2); count -= Math.pow(sides[4], 2); return (count);}// Driver Code // Regular Hexagon let sides = [ 1, 1, 1, 1, 1, 1 ]; document.write((calculateTriangles(sides)) + "<br/>"); // Irregular Hexagon let sides1 = [ 2, 2, 1, 3, 1, 2 ]; document.write((calculateTriangles(sides1)) + "<br/>"); </script> |
Output:
6 19
Time Complexity: O(1)
Auxiliary Space: O(1)
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!