求出系列的总和1 + 2 + 9 + 64 + 625 + 7776…直到N项

给定数字N ，任务是找到以下序列的和，直到N个项。

$1 + 2 + 9 + 64 + 625 + 7776 ...$

例子：

Input: N = 2 
Output: 3 
1 + 2 = 3
Input: N = 5 
Output: 701 
1 + 2 + 9 + 64 + 625 = 701 
 

方法：从给定的系列中，找到第N个项的公式：

1st term = 1 = 11-1
2nd term = 2 = 22-1
3rd term = 9 = 33-1
4th term = 64 = 44-1
.
.
Nthe term = NN - 1

所以：

Nth term of the series 

然后对[1，N]范围内的数字进行迭代，以使用上述公式查找所有项并计算其总和。
下面是上述方法的实现：

C++

*** QuickLaTeX cannot compile formula:
 

*** Error message:
Error: Nothing to show, formula is empty

Java

// C++ program for the above approach
 
#include 
using namespace std;
 
// Function to find the sum of series
void printSeriesSum(int N)
{
    long long sum = 0;
 
    for (int i = 1; i <= N; i++) {
 
        // Generate the ith term and
        // add it to the sum
        sum += pow(i, i - 1);
    }
 
    // Print the sum
    cout << sum << endl;
}
 
// Driver Code
int main()
{
    int N = 5;
 
    printSeriesSum(N);
    return 0;
}

Python3

// Java program for the above approach
class GFG{
  
// Function to find the sum of series
static void printSeriesSum(int N)
{
    long sum = 0;
  
    for (int i = 1; i <= N; i++) {
  
        // Generate the ith term and
        // add it to the sum
        sum += Math.pow(i, i - 1);
    }
  
    // Print the sum
    System.out.print(sum +"\n");
}
  
// Driver Code
public static void main(String[] args)
{
    int N = 5;
  
    printSeriesSum(N);
}
}
 
// This code is contributed by Princi Singh

C#

# Python3 program for the above approach
 
# Function to find the summ of series
def printSeriessumm(N):
    summ = 0
     
    for i in range(1,N+1):
         
        # Generate the ith term and
        # add it to the summ
        summ += pow(i, i - 1)
     
    # Prthe summ
    print(summ)
     
# Driver Code
 
N = 5
printSeriessumm(N)
 
# This code is contributed by shubhamsingh10

Javascript

// C# program for the above approach
using System;
 
class GFG{
   
// Function to find the sum of series
static void printSeriesSum(int N)
{
    double sum = 0;
   
    for (int i = 1; i <= N; i++) {
   
        // Generate the ith term and
        // add it to the sum
        sum += Math.Pow(i, i - 1);
    }
   
    // Print the sum
    Console.Write(sum +"\n");
}
   
// Driver Code
public static void Main(String[] args)
{
    int N = 5;
    printSeriesSum(N);
}
}
 
// This code is contributed by PrinciRaj1992

输出：

 
// javascript program for the above approach
 
// Function to find the sum of series
function printSeriesSum( N)
{
    let sum = 0;
 
    for (let i = 1; i <= N; i++) {
 
        // Generate the ith term and
        // add it to the sum
        sum += Math.pow(i, i - 1);
    }
 
    // Print the sum
    document.write(sum);
}
 
// Driver Code
 
    let N = 5;
 
    printSeriesSum(N);
    
// This code is contributed by todaysgaurav