Factorial Game

CodeChefOpen on judge ↗

Chef has found an ancient civilization. This civilization had $n$ distinct characters in their language. Now Chef is curious about possible number of distinct words (each letter should appear exactly once in every word) of length $n$ that can be formed. Since the answer could be very large, compute it modulo 1000000007 ($10^9 + 7$). ###Input: - First line will contain $Q$, number of quer

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