Unique Strings

CodeChefOpen on judge ↗

Given a string, your task is to calculate the number of different strings of the same length that can be created using its characters . ### Input The only input line has a string of length $n$. Each character is between a–z. ### Output Print the number of different strings modulo $10^9+7$. ### Constraints - $1 \leq n \leq 10^6$ ### Subtasks - **Subtask 1 (10 points):** $1 \leq M \leq 10$ - **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