Inversions
You are given two positive integers $N, K$, where $K \leq N$. Your goal is to find the number of permutations of $\{1, 2, ..., N\}$ with exactly $K$ [inversions](https://en.wikipedia.org/wiki/Inversion_(discrete_mathematics)). As the answer may be very large, you only need to find it modulo $2$. ###Input: - The first line contains one integer $T$, the number of test cases. Then the test case
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