Check if a given number divides the sum of the factorials of its digits
Given an integer N, the task is to check whether N divides the sum of the factorials of its digits.
Examples:
Input: N = 19
Output: Yes
1! + 9! = 1 + 362880 = 362881 which is divisible by 19.Input: N = 20
Output: No
0! + 2! = 1 + 4 = 5 which is not divisible by 20.
Approach: First, store the factorials of all the digits from 0 to 9 in an array. And, for the given number N check if it divides the sum of the factorials of its digits.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Function that returns true if n divides // the sum of the factorials of its digits bool isPossible(int n) { // To store factorials of digits int fac[10]; fac[0] = fac[1] = 1; for (int i = 2; i < 10; i++) fac[i] = fac[i - 1] * i; // To store sum of the factorials // of the digits int sum = 0; // Store copy of the given number int x = n; // Store sum of the factorials // of the digits while (x) { sum += fac[x % 10]; x /= 10; } // If it is divisible if (sum % n == 0) return true; return false; } // Driver code int main() { int n = 19; if (isPossible(n)) cout << "Yes"; else cout << "No"; return 0; } |
chevron_right
filter_none
Java
// Java implementation of the approach class GFG { // Function that returns true if n divides // the sum of the factorials of its digits static boolean isPossible(int n) { // To store factorials of digits int fac[] = new int[10]; fac[0] = fac[1] = 1; for (int i = 2; i < 10; i++) fac[i] = fac[i - 1] * i; // To store sum of the factorials // of the digits int sum = 0; // Store copy of the given number int x = n; // Store sum of the factorials // of the digits while (x != 0) { sum += fac[x % 10]; x /= 10; } // If it is divisible if (sum % n == 0) return true; return false; } // Driver code public static void main (String[] args) { int n = 19; if (isPossible(n)) System.out.println("Yes"); else System.out.println("No"); } } // This code is contributed by Ryuga |
chevron_right
filter_none
Python3
# Python 3 implementation of the approach # Function that returns true if n divides # the sum of the factorials of its digits def isPossible(n): # To store factorials of digits fac = [0 for i in range(10)] fac[0] = 1 fac[1] = 1 for i in range(2, 10, 1): fac[i] = fac[i - 1] * i # To store sum of the factorials # of the digits sum = 0 # Store copy of the given number x = n # Store sum of the factorials # of the digits while (x): sum += fac[x % 10] x = int(x / 10) # If it is divisible if (sum % n == 0): return True return False # Driver code if __name__ == '__main__': n = 19 if (isPossible(n)): print("Yes") else: print("No") # This code is contributed by # Surendra_Gangwar |
chevron_right
filter_none
C#
// C# implementation of the approach using System; class GFG { // Function that returns true if n divides // the sum of the factorials of its digits static bool isPossible(int n) { // To store factorials of digits int[] fac = new int[10]; fac[0] = fac[1] = 1; for (int i = 2; i < 10; i++) fac[i] = fac[i - 1] * i; // To store sum of the factorials // of the digits int sum = 0; // Store copy of the given number int x = n; // Store sum of the factorials // of the digits while (x != 0) { sum += fac[x % 10]; x /= 10; } // If it is divisible if (sum % n == 0) return true; return false; } // Driver code public static void Main () { int n = 19; if (isPossible(n)) Console.WriteLine("Yes"); else Console.WriteLine("No"); } } // This code is contributed by Code_Mech. |
chevron_right
filter_none
PHP
<?php // PHP implementation of the approach // Function that returns true if n divides // the sum of the factorials of its digits function isPossible($n) { // To store factorials of digits $fac = array(); $fac[0] = $fac[1] = 1; for ($i = 2; $i < 10; $i++) $fac[$i] = $fac[$i - 1] * $i; // To store sum of the factorials // of the digits $sum = 0; // Store copy of the given number $x = $n; // Store sum of the factorials // of the digits while ($x) { $sum += $fac[$x % 10]; $x /= 10; } // If it is divisible if ($sum % $n == 0) return true; return false; } // Driver code $n = 19; if (isPossible($n)) echo "Yes"; else echo "No"; // This code is contributed by Akanksha Rai ?> |
chevron_right
filter_none
Output:
Yes
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
Recommended Posts:
- Check if the sum of digits of a number N divides it
- Count of prime digits of a Number which divides the number
- Find last two digits of sum of N factorials
- Check whether product of digits at even places is divisible by sum of digits at odd place of a number
- Check if the sum of digits of number is divisible by all of its digits
- Check if a M-th fibonacci number divides N-th fibonacci number
- Check if the Xor of the frequency of all digits of a number N is zero or not
- Check if the frequency of all the digits in a number is same
- Check if all digits of a number divide it
- Check if a number has digits in the given Order
- Check if two numbers have same number of digits
- Check if a number with even number of digits is palindrome or not
- Check whether sum of digits at odd places of a number is divisible by K
- Check if N is divisible by a number which is composed of the digits from the set {A, B}
- Check if a given number can be represented in given a no. of digits in any base
- Program to check if a given number is Lucky (all digits are different)
- Check if the number is even or odd whose digits and base (radix) is given
- Check if given number contains a digit which is the average of all other digits
- Program to check if a number is divisible by any of its digits
- Program to check if a number is divisible by sum of its digits
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.
- Partition of a set into K subsets with equal sum using BitMask and DP
- Replace each element of Array with it's corresponding rank
- Find two numbers such that difference of their squares equal to N
- Median of sliding window in an array | Set 2
- Maximum number of 0s that can be flipped such that Array has no adjacent 1s