HSC BINNAS-SOMABESH(hard)

CodeChefOpen on judge ↗

This statement must remind you the most **** girl of your HSC math class. You are given a word of n letters. you have to find the number of different word can be constract , using every letter of the given word exactly once. Input First line contains a integer n ,the lenth of the word. (1Output Print the expected integer in a single line. As it is huge print answer modulo (1e9+7) Samples S

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