We need to find out the number of digit (s) of the factorial of an integer (N!) in that base. To solve this problem we can take help from logarithm formula and rules.

For each case, print the case number and the factorization of the factorial in the following format as given in samples. Case x: N = p 1 (power of p 1) * p 2 (power of p 2) * ... Here x is the case number, …

Given an integer **n**, you have to find whether it can be expressed as summation of factorials such

Factorial | LightOJ

This solution won't work for the given input, as the factorial value of the possible answer could be too large & looping through all possible natural numbers in the valid answer range would be too slow.

Easy Solved by: 2313 Success rate: 23.55% Intelligent Factorial Factorization LOJ-1035 Easy Solved by: 2753

Medium Solved by: 1516 Success rate: 55.41% Intelligent Factorial Factorization LOJ-1035 Easy Solved by: 2753