Triacontakaidigon数

给定数N ，任务是找到^第N^个Triacontakaidigon数。

A Triacontakaidigon number is class of figurate number. It has 32 – sided polygon called triacontakaidigon. The N-th triacontakaidigon number count’s the 32 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The first few triacontakaidigonol numbers are 1, 32, 93, 184 … 
 

例子：

Input: N = 2 
Output: 32 
Explanation: 
The second triacontakaidigonol number is 32. 
Input: N = 3 
Output: 93 
 

方法：第N个三角骨编号由下式给出：

• 侧多边形的第N个项= $\frac{((s-2)n^2 - (s-4)n)}{2}$
• 因此32边多边形的第N个项是

$Tn =\frac{((32-2)n^2 - (32-4)n)}{2} =\frac{(30n^2 - 28n)}{2}$

下面是上述方法的实现：

C++

// C++ program for above approach
#include 
using namespace std;
 
// Finding the nth triacontakaidigon Number
int triacontakaidigonNum(int n)
{
    return (30 * n * n - 28 * n) / 2;
}
 
// Driver Code
int main()
{
    int n = 3;
    cout << "3rd triacontakaidigon Number is = "
         << triacontakaidigonNum(n);
 
    return 0;
}
 
// This code is contributed by Akanksha_Rai

C

// C program for above approach
#include 
#include 
 
// Finding the nth triacontakaidigon Number
int triacontakaidigonNum(int n)
{
    return (30 * n * n - 28 * n) / 2;
}
 
// Driver program to test above function
int main()
{
    int n = 3;
    printf("3rd triacontakaidigon Number is = %d",
           triacontakaidigonNum(n));
 
    return 0;
}

Java

// Java program for above approach
class GFG{
     
// Finding the nth triacontakaidigon number
public static int triacontakaidigonNum(int n)
{
    return (30 * n * n - 28 * n) / 2;
}
 
// Driver code   
public static void main(String[] args)
{
    int n = 3;
     
    System.out.println("3rd triacontakaidigon Number is = " +
                                    triacontakaidigonNum(n));
}
}
 
// This code is contributed by divyeshrabadiya07

Python3

# Python3 program for above approach
 
# Finding the nth triacontakaidigon Number
def triacontakaidigonNum(n):
     
    return (30 * n * n - 28 * n) // 2
 
# Driver Code
n = 3
print("3rd triacontakaidigon Number is = ",
                   triacontakaidigonNum(n))
 
# This code is contributed by divyamohan123

C#

// C# program for above approach
using System;
class GFG{
     
// Finding the nth triacontakaidigon number
public static int triacontakaidigonNum(int n)
{
    return (30 * n * n - 28 * n) / 2;
}
 
// Driver code
public static void Main(String[] args)
{
    int n = 3;
     
    Console.WriteLine("3rd triacontakaidigon Number is = " +
                                   triacontakaidigonNum(n));
}
}
 
// This code is contributed by 29AjayKumar

Javascript

 
// javascript program for above approach
 
 
// Finding the nth triacontakaidigon Number
function triacontakaidigonNum( n)
{
    return (30 * n * n - 28 * n) / 2;
}
 
 
// Driver code
let n = 3;
document.write("3rd triacontakaidigon Number is " + triacontakaidigonNum(n));
 
// This code contributed by gauravrajput1
 

输出：

3rd triacontakaidigon Number is = 93

参考： https ： //en.wikipedia.org/wiki/Triacontadigon