📜  七边形数

📅  最后修改于: 2021-10-23 09:06:17             🧑  作者: Mango

给定一个数N ,任务是找到N七边形数。

例子:

方法:第N个七边形数由公式给出:

  • s 边多边形的第 N 项 = \frac{((s-2)n^2 - (s-4)n)}{2}
  • 因此 70 边多边形的第 N 项是

下面是上述方法的实现:

C++
// C++ program for above approach
#include 
using namespace std;
 
// Finding the nth heptacontagon number
int heptacontagonNum(int n)
{
    return (68 * n * n - 66 * n) / 2;
}
 
// Driver code
int main()
{
    int N = 3;
     
    cout << "3rd heptacontagon Number is = "
         << heptacontagonNum(N);
 
    return 0;
}
 
// This code is contributed by shivanisinghss2110


C
// C program for above approach
#include 
#include 
 
// Finding the nth heptacontagon Number
int heptacontagonNum(int n)
{
    return (68 * n * n - 66 * n) / 2;
}
 
// Driver code
int main()
{
    int N = 3;
    printf("3rd heptacontagon Number is = %d",
           heptacontagonNum(N));
 
    return 0;
}


Java
// Java program for the above approach
class GFG{
 
// Finding the nth heptacontagon number
static int heptacontagonNum(int n)
{
    return (68 * n * n - 66 * n) / 2;
}
 
// Driver Code
public static void main(String[] args)
{
    int N = 3;
    System.out.println("3rd heptacontagon Number is = " +
                                    heptacontagonNum(N));
}
}
 
// This code is contributed by rutvik_56


Python3
# Python3 program for above approach
 
# Finding the nth heptacontagon Number
def heptacontagonNum(n):
 
    return (68 * n * n - 66 * n) // 2;
 
# Driver code
N = 3;
print("3rd heptacontagon Number is =",
                 heptacontagonNum(N));
 
# This code is contributed by Akanksha_Rai


C#
// C# program for the above approach
using System;
class GFG{
 
// Finding the nth heptacontagon number
static int heptacontagonNum(int n)
{
    return (68 * n * n - 66 * n) / 2;
}
 
// Driver Code
public static void Main()
{
    int N = 3;
    Console.Write("3rd heptacontagon Number is = " +
                               heptacontagonNum(N));
}
}
 
// This code is contributed by Akanksha_Rai


Javascript


输出:
3rd heptacontagon Number is = 207

时间复杂度: O(1)

辅助空间: O(1)

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

如果您希望与专家一起参加现场课程,请参阅DSA 现场工作专业课程学生竞争性编程现场课程