Given an array arr[] of N integers. The task is to find the sum of factorials of each element of the array.
Examples:
Input: arr[] = {7, 3, 5, 4, 8}
Output: 45510
7! + 3! + 5! + 4! + 8! = 5040 + 6 + 120 + 24 + 40320 = 45510Input: 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 |
chevron_right
filter_none
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)); } } |
chevron_right
filter_none
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 |
chevron_right
filter_none
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 |
chevron_right
filter_none
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 ?> |
chevron_right
filter_none
Output:
45510
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Find the unit place digit of sum of N factorials
- Find last two digits of sum of N factorials
- Check if a given number divides the sum of the factorials of its digits
- Minimum number of Factorials whose sum is equal to N
- Sum of factorials of Prime numbers in a Linked list
- Count natural numbers whose factorials are divisible by x but not y
- Numbers whose factorials end with n zeros
- Calculating Factorials using Stirling Approximation
- Trailing number of 0s in product of two factorials
- Queries for the product of first N factorials
- GCD of factorials of two numbers
- Print factorials of a range in right aligned format
- Product of first N factorials
- Find an element in array such that sum of left array is equal to sum of right array
- Find Sum of all unique sub-array sum for a given array.
- Check if there exist two elements in an array whose sum is equal to the sum of rest of the array
- Rearrange an Array such that Sum of same-indexed subsets differ from their Sum in the original Array
- Given a sorted array and a number x, find the pair in array whose sum is closest to x
- Find the Initial Array from given array after range sum queries
- Find if array has an element whose value is half of array sum
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
