FACTORIAL

CodeChefOpen on judge ↗

Chef has a number N. He wants to find the number of ways in which factorial N can be expressed as a sum of two or more consecutive numbers. As Chef is very busy, he has entrusted this job to you. Print the result modulo 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$. ##

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