Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Find sum of factorials in an array

  • Last Updated : 15 Apr, 2021

Given an array arr[] of N integers. The task is to find the sum of factorials of each element of the array.

Examples: 

Hey! Looking for some great resources suitable for young ones? You've come to the right place. Check out our self-paced courses designed for students of grades I-XII. 

Start with topics like Python, HTML, ML, and learn to make some games and apps all with the help of our expertly designed content! So students worry no more, because GeeksforGeeks School is now here!

 



Input: arr[] = {7, 3, 5, 4, 8} 
Output: 45510 
7! + 3! + 5! + 4! + 8! = 5040 + 6 + 120 + 24 + 40320 = 45510

Input: arr[] = {2, 1, 3} 
Output: 9 
 

Approach: Implement a function factorial(n) that finds the factorial of n and initialize sum = 0. Now, traverse the given array and for each element arr[i] update sum = sum + factorial(arr[i]). Print the calculated sum in the end.

Below is the implementation of the above approach:  

C++




// C++ implementation of the approach
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
 
// Function to return the factorial of n
int factorial(int n)
{
    int f = 1;
    for (int i = 1; i <= n; i++)
    {
        f *= i;
    }
    return f;
}
 
// Function to return the sum of
// factorials of the array elements
int sumFactorial(int *arr, int n)
{
 
    // To store the required sum
    int s = 0,i;
    for (i = 0; i < n; i++)
    {
 
        // Add factorial of all the elements
        s += factorial(arr[i]);
    }
    return s;
}
 
// Driver code
int main()
{
    int arr[] = { 7, 3, 5, 4, 8 };
    int n = sizeof(arr) / sizeof(arr[0]);
    cout << sumFactorial(arr, n);
    return 0;
}
     
// This code is contributed by 29AjayKumar
Java



// Java implementation of the approach
class GFG {
 
    // Function to return the factorial of n
    static int factorial(int n)
    {
        int f = 1;
        for (int i = 1; i <= n; i++) {
            f *= i;
        }
        return f;
    }
 
    // Function to return the sum of
    // factorials of the array elements
    static int sumFactorial(int[] arr, int n)
    {
 
        // To store the required sum
        int s = 0;
        for (int i = 0; i < n; i++) {
 
            // Add factorial of all the elements
            s += factorial(arr[i]);
        }
        return s;
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        int[] arr = { 7, 3, 5, 4, 8 };
        int n = arr.length;
        System.out.println(sumFactorial(arr, n));
    }
}
Python3



# Python implementation of the approach
 
# Function to return the factorial of n
def factorial(n):
    f = 1;
    for i in range(1, n + 1):
        f *= i;
    return f;
 
# Function to return the sum of
# factorials of the array elements
def sumFactorial(arr, n):
 
    # To store the required sum
    s = 0;
    for i in range(0,n):
 
        # Add factorial of all the elements
        s += factorial(arr[i]);
    return s;
 
# Driver code
arr = [7, 3, 5, 4, 8 ];
n = len(arr);
print(sumFactorial(arr, n));
 
# This code contributed by Rajput-Ji
C#



// C# implementation of the approach
using System;
 
class GFG
{
 
    // Function to return the factorial of n
    static int factorial(int n)
    {
        int f = 1;
        for (int i = 1; i <= n; i++)
        {
            f *= i;
        }
        return f;
    }
 
    // Function to return the sum of
    // factorials of the array elements
    static int sumFactorial(int[] arr, int n)
    {
 
        // To store the required sum
        int s = 0;
        for (int i = 0; i < n; i++)
        {
 
            // Add factorial of all the elements
            s += factorial(arr[i]);
        }
        return s;
    }
 
    // Driver Code
    public static void Main()
    {
        int[] arr = { 7, 3, 5, 4, 8 };
        int n = arr.Length;
        Console.WriteLine(sumFactorial(arr, n));
    }
}
 
// This code is contributed by Ryuga
PHP



<?php
 
// PHP implementation of the approach
 
// Function to return the factorial of n
function factorial( $n)
{
    $f = 1;
    for ( $i = 1; $i <= $n; $i++)
    {
        $f *=$i;
    }
    return $f;
}
 
// Function to return the sum of
// factorials of the array elements
function sumFactorial($arr,  $n)
{
 
    // To store the required sum
    $s = 0;
    for ($i = 0; $i < $n; $i++)
    {
 
        // Add factorial of all the elements
        $s += factorial($arr[$i]);
    }
    return $s;
}
 
// Driver code
 
$arr = array( 7, 3, 5, 4, 8 );
$n = sizeof($arr);
echo sumFactorial($arr, $n);
 
// This code is contributed by ihritik
 
?>
    
Javascript



<script>
 
// Javascript implementation of the approach
 
// Function to return the factorial of n
function factorial(n)
{
    let f = 1;
    for(let i = 1; i <= n; i++)
    {
        f *= i;
    }
    return f;
}
 
// Function to return the sum of
// factorials of the array elements
function sumFactorial(arr, n)
{
 
    // To store the required sum
    let s = 0;
    for (let i = 0; i < n; i++)
    {
         
        // Add factorial of all the elements
        s += factorial(arr[i]);
    }
    return s;
}
 
// Driver code
let arr = [ 7, 3, 5, 4, 8 ];
let n = arr.length;
 
document.write(sumFactorial(arr, n));
 
// This code is contributed by bobby
 
</script>
Output: 
45510
 



My Personal Notes
arrow_drop_up
Previous
Factorial of an Array of integers
Next

Find sum of digits in factorial of a number
Recommended Articles
Page :
Find the unit place digit of sum of N factorials
28, Oct 18
Find last two digits of sum of N factorials
28, Oct 18
Prefix Factorials of a Prefix Sum Array
01, Jun 21
Check if a given number divides the sum of the factorials of its digits
01, Apr 19
Sum of factorials of Prime numbers in a Linked list
19, May 20
Minimum number of Factorials whose sum is equal to N
24, Mar 20
Count natural numbers whose factorials are divisible by x but not y
14, Jan 17
Numbers whose factorials end with n zeros
19, Dec 17
Calculating Factorials using Stirling Approximation
05, Jul 17
Trailing number of 0s in product of two factorials
13, Jan 18
Queries for the product of first N factorials
24, Sep 19
GCD of factorials of two numbers
11, Nov 17
Print factorials of a range in right aligned format
01, Dec 17
Product of first N factorials
27, May 18
Find an element in array such that sum of left array is equal to sum of right array
07, Sep 17
Find Sum of all unique sub-array sum for a given array.
18, May 18
Modify array to another given array by replacing array elements with the sum of the array
12, Feb 21
Find the Array Permutation having sum of elements at odd indices greater than sum of elements at even indices
07, Jul 21
Find position i to split Array such that prefix sum till i-1, i and suffix sum till i+1 are in GP with common ratio K
30, Sep 21
Check if there exist two elements in an array whose sum is equal to the sum of rest of the array
22, Feb 17
Minimize swaps between two arrays such that sum of the first array exceeds sum of the second array
18, Jan 21
Rearrange an Array such that Sum of same-indexed subsets differ from their Sum in the original Array
31, Jul 20
Generate an N-length array with sum equal to twice the sum of its absolute difference with same-indexed elements of given array
17, Jan 21
Difference between ceil of array sum divided by K and sum of ceil of array elements divided by K
03, May 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
facebookruppal
@facebookruppal
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!