Count Permutations

CodeChefOpen on judge ↗

Given N and K, count number of permutations of [1, 2, 3 ... N] in which no two adjacent elements differ by more than K. For example, permutation [4, 1, 2, 3] cannot be counted for K ∈ {0, 1, 2}. Input First line contains T, the number of test cases. Each test case consists of N and K in single line. Output For each test case print the required answer in one line. Constraints - 1 ≤ T ≤ 10

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