当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

4996：Revenge of LIS

题目描述
In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique.
---Wikipedia

Today, LIS takes revenge on you. You mission is counting how many permutation of 1-N has a LIS value equals K.
输入解释
The first line contains a single integer T, indicating the number of test cases.

Each test case only contains two integers, N and K.

[Technical Specification]
1. 1 <= T <= 200
2. 1 <= K <= N <= 18
输出解释
For each test case, output the number of eligible permutation.
输入样例 
3
3 1
3 2
3 3
输出样例 
1
4
1
提示
The possible permutations of 1, 2, 3 are [1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2] and [3, 2, 1].
And their LIS values are 3, 2, 2, 2, 2 and 1, successively.
来自杭电HDUOJ的附加信息
Recommend heyang
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 BestCoder Round #9
源链接： HDU-4996
最后修改于 2020-10-25T23:18:48+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)