Factorial

CodeChefOpen on judge ↗

This program is included so as everyone can score a minimum score. You are given $N$. You have to find $N!$. Since $N!$ can be large, output $N!$ modulo 1000000007 ($10^9 + 7$). ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, one integer $N$. ###Output: For each testcase, output in a s

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