-
Notifications
You must be signed in to change notification settings - Fork 360
/
Factorial
36 lines (31 loc) · 827 Bytes
/
Factorial
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
// 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));
}
}