三角形火柴棍数

给定一个代表火柴棒金字塔楼层的数字 X，编写一个程序来打印形成 x 层火柴棒金字塔所需的火柴棒总数。

例子：

Input : X = 1
Output : 3

Input : X = 2
Output : 9 

这主要是三角数的扩展。对于数字 X，所需的火柴棍将是第 X 个三角形数字的三倍，即 (3*X*(X+1))/2

C++

// C++ program to find X-th triangular
// matchstick number
 
#include 
using namespace std;
 
int numberOfSticks(int x)
{
    return (3 * x * (x + 1)) / 2;
}
 
int main()
{
    cout<

---

Java

// Java program to find X-th triangular
// matchstick number
public class TriangularPyramidNumber {
    public static int numberOfSticks(int x)
    {
        return (3 * x * (x + 1)) / 2;
    }
    public static void main(String[] args)
    {
        System.out.println(numberOfSticks(7));
    }
}

Python3

# Python program to find X-th triangular
# matchstick number
 
def numberOfSticks(x):
    return (3 * x * (x + 1)) / 2
     
# main()
print(int(numberOfSticks(7)))

C#

// C# program to find X-th triangular
// matchstick number
using System;
 
class GFG
{
    // Function to ind missing number
    static int numberOfSticks(int x)
    {
        return (3 * x * (x + 1)) / 2;
    }
 
    public static void Main()
    {
        Console.Write(numberOfSticks(7));
    }
}
 
// This code is contributed by _omg

Javascript

// javascript program to find X-th triangular
// matchstick number
 
function numberOfSticks( x)
{
    return (3 * x * (x + 1)) / 2;
}
 
   document.write(numberOfSticks(7));
 
// This code is contributed by aashish1995
 

输出：

84

如果您希望与专家一起参加现场课程，请参阅DSA 现场工作专业课程和学生竞争性编程现场课程。