给定一个数字n,找到 N 居中十六角数。 A. 中心十六角数 在连续的十六角(16边多边形)层中,表示中心的一个点及其周围的其他点。
null
前几个居中的十六进制数是: 1, 17, 49, 97, 161, 241, 337, 449, 577, 721, 881………………….
例如:
Input : 3Output : 49Input : 10Output : 721
在数学中,以十六角数为中心的 第n位 术语由以下公式给出:
以下是上述理念的基本实现:
C++
// C++ Program to find // nth centered hexadecagonal // number #include <bits/stdc++.h> using namespace std; // centered hexadecagonal function int center_hexadecagonal_num( long int n) { // Formula to calculate nth // centered hexadecagonal number return 8 * n * n - 8 * n + 1; } // Driver Code int main() { long int n = 2; cout << n << "th centered hexadecagonal number : " << center_hexadecagonal_num(n); cout << endl; n = 12; cout << n << "th centered hexadecagonal numbe : " << center_hexadecagonal_num(n); return 0; } |
JAVA
// Java Program to find nth // centered hexadecagonal number import java.io.*; class GFG { // centered hexadecagonal function static int center_hexadecagonal_num( int n) { // Formula to calculate nth // centered hexadecagonal number return 8 * n * n - 8 * n + 1 ; } // Driver Code public static void main(String args[]) { int n = 2 ; System.out.print(n + "th centered " + "hexadecagonal number: " ); System.out.println(center_hexadecagonal_num(n)); n = 12 ; System.out.print(n + "th centered " + "hexadecagonal number: " ); System.out.println(center_hexadecagonal_num(n)); } } // This code is contributed by ajit. |
Python3
# Program to find nth # centered hexadecagonal # number # centered hexadecagonal # function def center_hexadecagonal_num(n): # Formula to calculate # nth centered hexadecagonal # number return 8 * n * n - 8 * n + 1 # Driver Code if __name__ = = '__main__' : n = 2 print (n, "nd centered hexadecagonal " + "number : " , center_hexadecagonal_num(n)) n = 12 print (n, "th centered hexadecagonal " + "number : " , center_hexadecagonal_num(n)) # This code is contributed # by akt_mit |
C#
// C# Program to find nth // centered hexadecagonal number using System; class GFG { // centered hexadecagonal // function static int center_hexadecagonal_num( int n) { // Formula to calculate nth // centered hexadecagonal number return 8 * n * n - 8 * n + 1; } // Driver Code static public void Main () { int n = 2; Console.Write(n + "th centered " + "hexadecagonal number: " ); Console.WriteLine(center_hexadecagonal_num(n)); n = 12; Console.Write(n + "th centered " + "hexadecagonal number: " ); Console.WriteLine(center_hexadecagonal_num(n)); } } // This code is contributed by m_kit |
PHP
<?php // PHP Program to find // nth centered hexadecagonal // number // centered hexadecagonal function function center_hexadecagonal_num( $n ) { // Formula to calculate nth // centered hexadecagonal number return 8 * $n * $n - 8 * $n + 1; } // Driver Code $n = 2; echo $n , "th centered hexadecagonal number : " , center_hexadecagonal_num( $n ); echo "" ; $n = 12; echo $n , "th centered hexadecagonal numbe : " , center_hexadecagonal_num( $n ); // This code is contributed by ajit ?> |
Javascript
<script> // Javascript Program to find nth // centered hexadecagonal number // Centered hexadecagonal function function center_hexadecagonal_num(n) { // Formula to calculate nth // centered hexadecagonal number return 8 * n * n - 8 * n + 1; } // Driver code var n = 2; document.write(n + "th centered " + "hexadecagonal number: " ); document.write(center_hexadecagonal_num(n) + "<br>" ); n = 12; document.write(n + "th centered " + "hexadecagonal number: " ); document.write(center_hexadecagonal_num(n)); // This code is contributed by Ankita saini </script> |
输出:
2th centered hexadecagonal number : 1712th centered hexadecagonal numbe : 1057
时间复杂性: O(1) 辅助空间: O(1)
参考资料: http://oeis.org/A069129
© 版权声明
文章版权归作者所有,未经允许请勿转载。
THE END