Big Factorial

CodeChefOpen on judge ↗

Given an integer $N$. Find the factorial for the given integer $N$ modulo $1000000007$. ###Input: - The first line of input contains number of test cases $T$. - First line of each test case will contain a single integer $N$. ###Output: For each test case, output factorial of the given integer $N$ modulo $1000000007$. ###Constraints - $1 \leq T\leq 10^5$ - $0 \leq N\leq 10^5$ ###

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