中心十边形数

给定一个数字n,找到 N 中心十边数。 A. 中心十边形数 是一个居中的数字,代表一个十边形,中心有点,周围有连续十边形的所有其他点。来源 [维基] .

null

Center Decagonal number

前几个以十边形为中心的数字是: 1, 11, 31, 61, 101, 151, 211, 281, 361, 451, 551, 661………… 例如:

Input :  3Output : 31Input : 6Output : 151

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

Cd_{n}= 5n^2+5n+1

下面是上述想法的基本实现。

C++

// Program to find nth
// centered decagonal
// number
#include <bits/stdc++.h>
using namespace std;
// Centered decagonal
// number function
int centereddecagonalnum( int n)
{
// Formula to calculate nth
// centered decagonal number &
// return it into main function.
return (5 * n * n + 5 * n + 1);
}
// Driver Code
int main()
{
int n = 5;
cout << n << "th centered decagonal"
<< "number: " ;
cout << centereddecagonalnum(n);
cout << endl;
n = 9;
cout << n << "th centered decagonal"
<< "number: " ;
cout << centereddecagonalnum(n);
return 0;
}


JAVA

// Java Program to find nth
// centered decagonal number
import java.io.*;
class GFG
{
// Centered decagonal
// number function
static int centereddecagonalnum( int n)
{
// Formula to calculate nth
// centered decagonal number &
// return it into main function.
return ( 5 * n * n + 5 * n + 1 );
}
// Driver Code
public static void main (String[] args)
{
int n = 5 ;
System.out.print(n + "th centered " +
"decagonal number: " );
System.out.println(centereddecagonalnum(n));
n = 9 ;
System.out.print(n + "th centered " +
"decagonal number: " );
System.out.println(centereddecagonalnum(n));
}
}
// This code is contributed by m_kit


Python3

# Program to find nth
# centered decagonal number
# Centered decagonal
# number function
def centereddecagonalnum(n) :
# Formula to calculate
# nth centered decagonal
# number & return it
# into main function.
return ( 5 * n * n +
5 * n + 1 )
# Driver Code
if __name__ = = '__main__' :
n = 5
print (n, "th centered decagonal " +
"number : " ,
centereddecagonalnum(n))
n = 9
print (n, "th centered decagonal " +
"number : " ,
centereddecagonalnum(n))
# This code is contributed by m_kit


C#

// Program to find nth
// centered decagonal
// number
using System;
class GFG
{
// Centered decagonal
// number function
static int centereddecagonalnum( int n)
{
// Formula to calculate nth
// centered decagonal number &
// return it into main function.
return (5 * n * n + 5 * n + 1);
}
// Driver Code
static public void Main ()
{
int n = 5;
Console.Write(n + "th centered decagonal" +
"number: " );
Console.WriteLine(centereddecagonalnum(n));
n = 9;
Console.Write(n + "th centered decagonal" +
"number: " );
Console.WriteLine(centereddecagonalnum(n));
}
}
// This code is contributed by aj_36


PHP

<?php
// Program to find nth
// centered decagonal number
// Centered decagonal
// number function
function centereddecagonalnum( $n )
{
// Formula to calculate
// nth centered decagonal
// number & return it
// into main function.
return (5 * $n * $n +
5 * $n + 1);
}
// Driver Code
$n = 5;
echo $n , "th centered decagonal" ,
"number: " ;
echo centereddecagonalnum( $n );
echo "" ;
$n = 9;
echo $n , "th centered decagonal" ,
"number: " ;
echo centereddecagonalnum( $n );
// This code is contributed by ajit
?>


Javascript

<script>
// Javascript Program to find nth
// centered decagonal number
// Centered decagonal
// number function
function centereddecagonalnum(n)
{
// Formula to calculate nth
// centered decagonal number &
// return it into main function.
return (5 * n * n + 5 * n + 1);
}
// Driver Code
var n = 5;
document.write(n + "th centered " +
"decagonal number: " );
document.write(centereddecagonalnum(n) + "<br>" );
n = 9;
document.write(n + "th centered " +
"decagonal number: " );
document.write(centereddecagonalnum(n));
// This code is contributed by Kirti
</script>


输出

5th centered decagonalnumber: 1519th centered decagonalnumber: 451

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

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