非角数

A. 非角数 是一个数字,它将三角形和正方形的概念扩展到了非三角形。具体地说,第n个非角数统计n个嵌套的非角(9边多边形)图案中的点的数量,所有这些点共享一个公共角,其中图案中的第i个非角具有由i个点构成的边,这些点彼此间隔一个单位。

null

例如:

Input : n = 10       n (7n - 5) / 2       10 * (7 * 10 - 5) / 2       10 * 65 / 2 = 325Output :325Input : 15Output :750

这个 N th 非角数 由以下公式给出: n(7n-5)/2 .

C++

// CPP Program to find
// nth nonagonal number.
#include <bits/stdc++.h>
using namespace std;
// Function to find nth
// nonagonal number.
int Nonagonal( int n)
{
// Formula to find nth
// nonagonal number.
return n * (7 * n - 5) / 2;
}
// Driver function.
int main()
{
int n = 10;
cout << Nonagonal(n);
return 0;
}


JAVA

// Java Program to find
// nth nonagonal number.
import java.io.*;
class GFG {
// Function to find nth
// nonagonal number.
static int Nonagonal( int n)
{
// Formula to find nth
// nonagonal number.
return n * ( 7 * n - 5 ) / 2 ;
}
// Driver function.
public static void main(String args[])
{
int n = 10 ;
System.out.println(Nonagonal(n));
}
}
// This code is contributed by Nikita Tiwari.


Python3

# Python 3 Program to find
# nth nonagonal number.
# Function to find nth
# nonagonal number.
def Nonagonal(n):
# Formula to find nth
# nonagonal number.
return int (n * ( 7 * n - 5 ) / 2 )
n = 10
print (Nonagonal(n))
# This code is contributed by
# Smitha Dinesh Semwal


C#

// C# Program to find
// nth nonagonal number.
using System;
class GFG {
// Function to find nth
// nonagonal number.
static int Nonagonal( int n)
{
// Formula to find nth
// nonagonal number.
return n * (7 * n - 5) / 2;
}
// Driver function.
public static void Main()
{
int n = 10;
Console.Write(Nonagonal(n));
}
}
// This code is contributed by vt_m.


PHP

<?php
// PHP Program to find
// nth nonagonal number.
// Function to find nth
// nonagonal number.
function Nonagonal( $n )
{
// Formula to find nth
// nonagonal number.
return $n * (7 * $n - 5) / 2;
}
// Driver Code
$n = 10;
echo Nonagonal( $n );
// This code is contributed by vt_m.
?>


Javascript

<script>
// Javascript Program to find
// nth nonagonal number.
// Function to find nth
// nonagonal number.
function Nonagonal(n)
{
// Formula to find nth
// nonagonal number.
return parseInt(n * (7 * n - 5) / 2);
}
// Driver function.
let n = 10;
document.write(Nonagonal(n));
// This code is contributed by souravmahato348.
</script>


输出:

325

时间复杂性: O(1)

辅助空间: O(1)

给定一个数n,找到直到n项的非角数列 .

C++

// CPP Program find first
// n nonagonal number.
#include <bits/stdc++.h>
using namespace std;
// Function to find nonagonal
// number series.
int Nonagonal( int n)
{
for ( int i = 1; i <= n; i++)
{
cout << i * (7 * i - 5) / 2;
cout << " " ;
}
}
// Driver Code
int main()
{
int n = 10;
Nonagonal(n);
return 0;
}


JAVA

// Java Program find first
// n nonagonal number.
import java.io.*;
class GFG
{
// Function to find nonagonal
// number series.
static void Nonagonal( int n)
{
for ( int i = 1 ; i <= n; i++)
{
System.out.print(i * ( 7 *
i - 5 ) / 2 );
System.out.print( " " );
}
}
// Driver Code
public static void main(String args[])
{
int n = 10 ;
Nonagonal(n);
}
}
// This code is contributed
// by Nikita Tiwari.


Python3

# Python 3 Program find first
# n nonagonal number.
# Function to find nonagonal
# number series.
def Nonagonal(n):
for i in range ( 1 , n + 1 ):
print ( int (i * ( 7 * i - 5 ) / 2 ),end = " " )
# driver Function
n = 10
Nonagonal(n)
# This code is contributed by
# Smitha Dinesh Semwal


C#

// C# Program find first
// n nonagonal number.
using System;
class GFG
{
// Function to find nonagonal
// number series.
static void Nonagonal( int n)
{
for ( int i = 1; i <= n; i++)
{
Console.Write(i * (7 *
i - 5) / 2);
Console.Write( " " );
}
}
// Driver Code
public static void Main()
{
int n = 10;
Nonagonal(n);
}
}
// This code is contributed by vt_m.


PHP

<?php
// PHP Program find first
// n nonagonal number.
// Function to find nonagonal
// number series.
function Nonagonal( $n )
{
for ( $i = 1; $i <= $n ; $i ++)
{
echo $i * (7 * $i - 5) / 2;
echo " " ;
}
}
// Driver Code
$n = 10;
Nonagonal( $n );
// This code is contributed by ajit
?>


Javascript

<script>
// Javascript Program find first
// n nonagonal number.
// Function to find nonagonal
// number series.
function Nonagonal(n)
{
for (let i = 1; i <= n; i++)
{
document.write(parseInt(i * (7 * i - 5) / 2) + " " );
}
}
// Driver Code
let n = 10;
Nonagonal(n);
</script>


输出:

1 9 24 46 75 111 154 204 261 325 

时间复杂性: O(n)

辅助空间: O(1)

参考: https://en.wikipedia.org/wiki/Nonagonal_number

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