Playing Factorial

CodeChefOpen on judge ↗

Abhishek and Avnish are playing a math game with Alka. Let's define for positive integer $X$ as a product of factorials of its digits. For example, $F(243) = 2! * 4! * 3! = 288$ First they choose a number $A$ consisting of $N$ digits that contains at least one digit larger than 1. Then they should find maximum positive number $X$ satisfying following two conditions: 1. $X$ doesn't contain neit

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI