Large Factorial

CodeChefOpen on judge ↗

You are given a number $n$ , print it's factorial under modulo $10^9+7$ ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains a single line of input, containing an integer n. ###Output: For each testcase, output in a single line n factorial modulo 1000000007. ###Constraints - $1 \leq T \leq 10$ - $0 \leq n \leq 1000$ ###Sample I

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