Atapi Vatapi

CodeChefOpen on judge ↗

No Sacred Games reference for this problem, but still, we wish you all the best :). Let's define a function F(N) such that for $N > 0$, $F(N) = (N)! - (N - 1)! + (N - 2)! - (N - 3)! + (N - 4)! .. .. .. 1!$ You just have the print the value of $F(N)$ modulo ($10^9 + 7$). Here, $N!$ denotes the factorial of $N$ and *modulo* operation finds the remainder after division of one number by another

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