Reverse Factorial

CodeChefOpen on judge ↗

Chef has an integer $N$. He knows that the factorial of a number $a$ is $a * (a - 1) * (a - 2) * . . . * 2 * 1$. Instead of finding the factorial of the interge $N$ that he has, he wants to find if there exists a number $M$ such that the factorial of $M$ is $N$. Help him find if there is a number $M$ such that $M!$ = $N$. Answer for $T$ test cases. ### Input - First line will contain $T$,

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