中心八角数

给定一个数字n,找到 N 居中的八角数。 这个 中心八角数 表示中心的一个点,其他点以八边形(18边多边形)的连续层排列在其周围。

null

center_octadecagon_num

例如:

Input :  2Output : 19Input : 6Output : 271

在数学中,以八角数为中心的 第n位 术语由以下公式给出:

CO_{n}= 9n^2 -9n+1

以下是上述理念的基本实现:

C++

// C++ Program to find the
// nth centered octadecagonal
// number
#include <bits/stdc++.h>
using namespace std;
// centered octadecagon  function
int center_octadecagon_num( long int n)
{
// Formula to calculate nth
// centered octadecagonal number
return 9 * n * n - 9 * n + 1;
}
// Driver Code
int main()
{
long int n = 3;
cout << n << "th centered octadecagonal number : "
<< center_octadecagon_num(n);
cout << endl;
n = 13;
cout << n << "th centered octadecagonal number : "
<< center_octadecagon_num(n);
return 0;
}


JAVA

// Java Program to find the
// nth centered octadecagonal
// number
import java.io.*;
class GFG
{
// centered octadecagon function
static int center_octadecagon_num( int n)
{
// Formula to calculate nth
// centered octadecagonal number
return 9 * n * n - 9 * n + 1 ;
}
// Driver Code
public static void main (String[] args)
{
int n = 3 ;
System.out.print(n + "th centered " +
"octadecagonal number : " );
System.out.println(center_octadecagon_num(n));
n = 13 ;
System.out.print(n + "th centered " +
"octadecagonal number : " );
System.out.println(center_octadecagon_num(n));
}
}
// This code is contributed by ajit


Python3

# Program to find nth
# centered octadecagonal number
# Centered octadecagonal
# number function
def center_octadecagon_num(n) :
# Formula to calculate
# nth centered octadecagonal
# number & return it
# into main function.
return ( 9 * n * n -
9 * n + 1 )
# Driver Code
if __name__ = = '__main__' :
n = 3
print (n, "rd centered octadecagonal " +
"number : " ,
center_octadecagon_num(n))
n = 13
print (n, "th centered octadecagonal " +
"number : " ,
center_octadecagon_num(n))
# This code is contributed
# by akt_mit


C#

// C# Program to find the
// nth centered octadecagonal
// number
using System;
class GFG
{
// centered octadecagon function
static int center_octadecagon_num( int n)
{
// Formula to calculate nth
// centered octadecagonal number
return 9 * n * n - 9 * n + 1;
}
// Driver Code
static public void Main ()
{
int n = 3;
Console.Write( n + "th centered " +
"octadecagonal number : " );
Console.WriteLine( center_octadecagon_num(n));
n = 13;
Console.Write( n + "th centered " +
"octadecagonal number : " );
Console.WriteLine(center_octadecagon_num(n));
}
}
// This code is contributed by aj_36.


PHP

<?php
// PHP Program to find the
// nth centered octadecagonal
// number
// centered octadecagon function
function center_octadecagon_num( $n )
{
// Formula to calculate nth
// centered octadecagonal number
return (9 * $n * $n -
9 * $n + 1);
}
// Driver Code
$n = 3;
echo $n , "th centered octadecagonal " .
"number : " ,
center_octadecagon_num( $n );
echo "" ;
$n = 13;
echo $n , "th centered octadecagonal " .
"number : " ,
center_octadecagon_num( $n );
// This code is contributed by m_kit
?>


Javascript

<script>
// Javascript program to find the
// nth centered octadecagonal
// number
// centered octadecagon function
function center_octadecagon_num(n)
{
// Formula to calculate nth
// centered octadecagonal number
return 9 * n * n - 9 * n + 1;
}
// Driver Code
var n = 3;
document.write(n + "th centered " +
"octadecagonal number : " );
document.write(center_octadecagon_num(n) + "<br>" );
n = 13;
document.write(n + "th centered " +
"octadecagonal number : " );
document.write(center_octadecagon_num(n));
// This code is contributed by Kirti
</script>


输出:

3th centered octadecagonal number : 5513th centered octadecagonal number : 1405

时间复杂性: O(1) 辅助空间: O(1)

© 版权声明
THE END
喜欢就支持一下吧
点赞12 分享