十六进制数

给定一个数 n，任务是找到第 n 个十六进制数。
十六进制数是数字类和完全平方数。它有十六边的多边形，称为十六边形或十六边形。第 n 个十六进制数是十六个点，所有其他点都围绕其连续层。
例子 ：

Input : 2 
Output :16
Input :7 
Output :301 
 

十六进制数的计算公式：

$\begin{math} Hg_{n}=(14n^2-12n)/2 \end{math}$

C++

// C++ program to find Nth
// hexadecagon number
#include 
using namespace std;
 
// Function to calculate hexadecagonal number
int hexadecagonalNum(long int n)
{
    return ((14 * n * n) - 12 * n) / 2;
}
 
// Drivers Code
int main()
{
    long int n = 5;
    cout << n << "th Hexadecagonal number : ";
    cout << hexadecagonalNum(n);
    cout << endl;
    n = 9;
    cout << n << "th Hexadecagonal number : ";
    cout << hexadecagonalNum(n);
 
    return 0;
}

Java

// Java program to find Nth hexadecagon
// number
import java.io.*;
 
class GFG {
 
    // Function to calculate hexadecagonal
    // number
    static long hexadecagonalNum(long n)
    {
        return ((14 * n * n) - 12 * n) / 2;
    }
     
    // Drivers Code
    public static void main (String[] args)
    {
        long n = 5;
        System.out.println( n + "th "
          + "Hexadecagonal number : "
              + hexadecagonalNum(n));
               
        n = 9;
        System.out.println( n + "th "
          + "Hexadecagonal number : "
              + hexadecagonalNum(n));
    }
}
 
// This code contribued by anuj_67.

Python3

# Python program to find Nth
# hexadecagon number
 
# Function to calculate
# hexadecagonal number
def hexadecagonalNum(n):
 
    # Formula to calculate nth
    # Centered hexadecagonal number
    return ((14 * n * n) - 12 * n) // 2
 
# Driver Code
n = 5
print("%sth Hexadecagonal number : " %n,
                    hexadecagonalNum(n))
n = 9
print("%sth Hexadecagonal number : " %n,
                    hexadecagonalNum(n))
                     
# This code is contributed by ajit

C#

// C# program to find Nth hexadecagon
// number
using System;
class GFG {
 
    // Function to calculate hexadecagonal
    // number
    static long hexadecagonalNum(long n)
    {
        return ((14 * n * n) - 12 * n) / 2;
    }
     
    // Drivers Code
    public static void Main ()
    {
        long n = 5;
        Console.WriteLine( n + "th "
        + "Hexadecagonal number : "
            + hexadecagonalNum(n));
             
        n = 9;
        Console.WriteLine( n + "th "
        + "Hexadecagonal number : "
            + hexadecagonalNum(n));
    }
}
 
// This code contribued by anuj_67.

Javascript

 
// Javascript program to find Nth hexadecagon
// number
 
// Function to calculate hexadecagonal
// number
function hexadecagonalNum(n)
{
    return ((14 * n * n) - 12 * n) / 2;
}
 
// Driver code
var n = 5;
document.write(n + "th " +
               "Hexadecagonal number : " +
               hexadecagonalNum(n) + "<br>");
   
n = 9;
document.write(n + "th " +
               "Hexadecagonal number : " +
               hexadecagonalNum(n));
 
// This code is contributed by Khushboogoyal499
 

输出 ：

5th Hexadecagonal number : 145
9th Hexadecagonal number : 513

时间复杂度： O(1)
辅助空间： O(1)

参考：https://en.wikipedia.org/wiki/Polygonal_number

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