中心非十边形数

给定一个数字n,找到 N 居中的非十边形数。 A. 中心非十边形数 在连续的十边形(19边多边形)层中表示中心的一个点和围绕它的其他点。

null

center_nonadecagonalnum

前几个以中心为中心的非十边形数是: 1, 20, 58, 115, 191, 286, 400, 533, 685, 856, 1046, 1255…………………………… 例如:

Input :  3Output : 58 Input : 13Output :1483

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

CN_{n}= (19n^2 - 19n +2)/2

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

C++

// C++ Program to find
// nth centered
// nonadecagonal number
#include <bits/stdc++.h>
using namespace std;
// centered nonadecagonal
//  function
int center_nonadecagon_num( long int n )
{
// Formula to calculate nth
// centered nonadecagonal number
return (19 * n * n - 19 * n + 2) / 2;
}
// Driver Code
int main()
{
long int n = 2;
cout << n << "th centered nonadecagonal number : "
<< center_nonadecagon_num(n);
cout << endl;
n = 7;
cout << n << "th centered nonadecagonal number : "
<< center_nonadecagon_num(n);
return 0;
}


JAVA

// Java Program to find nth centered
// nonadecagonal number
import java.io.*;
class GFG {
// centered nonadecagonal
// function
static int center_nonadecagon_num( int n)
{
// Formula to calculate nth
// centered nonadecagonal number
return ( 19 * n * n - 19 * n + 2 ) / 2 ;
}
// Driver code
public static void main (String[] args)
{
int n = 2 ;
System.out.print ( n + "th centered "
+ "nonadecagonal number : " );
System.out.println (
center_nonadecagon_num(n));
n = 7 ;
System.out.print ( n + "th centered "
+ "nonadecagonal number : " );
System.out.println(
center_nonadecagon_num(n));
}
}
// This code is contributed by m_kit


Python3

# Program to find nth
# centered nonadecagonal number
def center_nonadecagon_num(n) :
# Formula to calculate
# nth centered nonadecagonal
# number & return it into
# main function.
return ( 19 * n * n -
19 * n + 2 ) / / 2
# Driver Code
if __name__ = = '__main__' :
n = 2
print (n, "nd centered nonadecagonal " +
"number : " ,
center_nonadecagon_num(n))
n = 7
print (n, "nd centered nonadecagonal " +
"number : " ,
center_nonadecagon_num(n))
# This code is contributed by ajit


C#

// C# Program to find
// nth centered
// nonadecagonal number
using System;
class GFG
{
// centered nonadecagonal
// function
static int center_nonadecagon_num( int n)
{
// Formula to calculate nth
// centered nonadecagonal number
return (19 * n * n -
19 * n + 2) / 2;
}
// Driver code
static public void Main ()
{
int n = 2;
Console.Write ( n + "th centered " +
"nonadecagonal number : " );
Console.WriteLine(
center_nonadecagon_num(n));
n = 7;
Console.Write( n + "th centered " +
"nonadecagonal number : " );
Console.WriteLine(
center_nonadecagon_num(n));
}
}
// This code is contributed by ajit


PHP

<?php
// PHP Program to find
// nth centered
// nonadecagonal number
// centered nonadecagonal
// function
function center_nonadecagon_num( $n )
{
// Formula to calculate nth
// centered nonadecagonal number
return (19 * $n * $n -
19 * $n + 2) / 2;
}
// Driver Code
$n = 2;
echo $n , "th centered " +
"nonadecagonal number : " ,
center_nonadecagon_num( $n );
echo "" ;
$n = 7;
echo $n , "th centered " +
"nonadecagonal number : " ,
center_nonadecagon_num( $n );
// This code is contributed by ajit
?>


Javascript

<script>
// Javascript program to find nth centered
// nonadecagonal number
// centered nonadecagonal
// function
function center_nonadecagon_num(n)
{
// Formula to calculate nth
// centered nonadecagonal number
return (19 * n * n - 19 * n + 2) / 2;
}
// Driver Code
var n = 2;
document.write(n + "th centered " +
"nonadecagonal number : " );
document.write(center_nonadecagon_num(n) + "<br>" );
n = 7;
document.write(n + "th centered " +
"nonadecagonal number : " );
document.write(center_nonadecagon_num(n));
// This code is contributed by Kirti
</script>


输出:

2th centered nonadecagonal number : 207th centered nonadecagonal numbe : 400

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

参考资料: http://oeis.org/A069132

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