Permutations
CodeChefOpen on judge ↗
How many permutations of the first N numbers exist such that the maximum element between the indices [i..j] is either present at index i, or at index j ? Input The first line contains the number of test cases T (Output Output T lines containing the required answer for the corresponding test case. Since the answers can get really big, output the result modulo 1000000007. Example Input: 1 2 Ou
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.
Sign in to chat with the tutor and save your progress.
Sign in to start