Given a number X which represents the floor of a matchstick pyramid, write a program to print the total number of matchstick required to form a pyramid of matchsticks of x floors.
Examples:
Input : X = 1 Output : 3 Input : X = 2 Output : 9
This is mainly an extension of triangular numbers. For a number X, the matchstick required will be three times of X-th triangular numbers, i.e., (3*X*(X+1))/2
# Python program to find X-th triangular # matchstick number def numberOfSticks(x): return (3 * x * (x + 1)) / 2 # main() print(int(numberOfSticks(7))) |
Output:
84
Please refer complete article on Triangular Matchstick Number for more details!
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!
<!–
–>
Triangular Matchstick Number
Program to print Lower triangular and Upper triangular matrix of an array
Program to print triangular number series till n
Program to check if N is a Centered Triangular Number
First triangular number whose number of divisors exceeds N
Find the sequence number of a triangular number
Python Program to check if matrix is lower triangular
Python Program to check if matrix is upper triangular
Program to check if matrix is lower triangular
Program for triangular patterns of alphabets
Mathematical and Geometric Algorithms – Data Structure and Algorithm Tutorials
Learn Data Structures with Javascript | DSA Tutorial
Introduction to Max-Heap – Data Structure and Algorithm Tutorials
Introduction to Set – Data Structure and Algorithm Tutorials
Introduction to Map – Data Structure and Algorithm Tutorials
Article Contributed By :
neveropen
Vote for difficulty
Article Tags :
Report Issue
<!–
Please write us at contribute@neveropen.co.uk to report any issue with the above content
–>
Please Login to comment…