시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
2 초 | 256 MB | 50 | 34 | 32 | 66.667% |
Find the number of pairs $(p, q)$ of permutations of length $n$ such that $\sum\limits_{i=1}^n \max(p_i, q_i) = k$.
As the answer may be large, find it modulo $10^9 + 7$.
The only line contains two integers, $n$ and $k$ ($1 \le n \le 100$, $1 \le k \le n^2$).
Print the answer modulo $10^9 + 7$.
2 4
2
3 7
12