Find F

CodeChefOpen on judge ↗

###Problem Statement Given an integer $N$. Find the value $F$ which is $N*(N-1)*(N-2)*....*1$. Here $*$ indicates multiplication. ###Input - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains a line contains an integer $N$. ###Output For each test case, display $F$. ###Constraints - $1 \leq T \leq 1000$ - $1 \leq N \leq

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