Jumbling Nuisance

CodeChefOpen on judge ↗

A hacker has planned to manipulate a message made of $n$ distinct characters. His plan is to jumble up all characters in such a manner that no character takes its own place. Find the number of the ways in which he can accomplish his goal. ### Input: Each test case consists of only a single line which represents the number of distinct characters, $n$. ### Output: Print the number of the ways in w

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