Permutations

CodeChefOpen on judge ↗

There are N numbers which has to be arranged. You are given M constraints of the form (a, b) which means that a has to appear before b in the arrangement. Compute the number of arrangements possible modulo 1000000007. Input Input description. The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The first line of each tes

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