📜  257-gon number

📅  最后修改于: 2021-04-23 05:23:47             🧑  作者: Mango

给定数字N ,任务是找到N257-gon数。

例子:

方法:第N 257-gon数由以下公式给出:

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

下面是上述方法的实现:

C++
// C++ implementation for
// above approach
#include 
using namespace std;
 
// Function to find the
// nth 257-gon Number
int gonNum257(int n)
{
    return (255 * n * n - 253 * n) / 2;
}
 
// Driver Code
int main()
{
    int n = 3;
    cout << gonNum257(n);
 
    return 0;
}


Java
// Java program for above approach
class GFG{
 
// Function to find the
// nth 257-gon Number
static int gonNum257(int n)
{
    return (255 * n * n - 253 * n) / 2;
}
 
// Driver code
public static void main(String[] args)
{
    int n = 3;
    System.out.print(gonNum257(n));
}
}
 
// This code is contributed by shubham


Python3
# Python3 implementation for
# above approach
 
# Function to find the
# nth 257-gon Number
def gonNum257(n):
 
    return (255 * n * n - 253 * n) // 2;
 
# Driver Code
n = 3;
print(gonNum257(n));
 
# This code is contributed by Code_Mech


C#
// C# program for above approach
using System;
class GFG{
 
// Function to find the
// nth 257-gon Number
static int gonNum257(int n)
{
    return (255 * n * n - 253 * n) / 2;
}
 
// Driver code
public static void Main(String[] args)
{
    int n = 3;
    Console.Write(gonNum257(n));
}
}
 
// This code is contributed by sapnasingh4991


Javascript


输出:
768

参考: https //en.wikipedia.org/wiki/257-gon