当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
5376：Convex Polygon
题目描述
Cute qzy wants to calculate how many convex polygons with M vertices and K acute angles when selecting M vertices in a regular polygon with N vertices(N is odd).But he is busy with girls,so he asks you for help.Can you solve it?
输入解释
The first line contains a number T, indicating the number of test cases.(T≤50000)
For each case, there are three numbers N(3≤N≤100000), M(3≤M≤N), K(0≤K≤M), as described previously.
For each case, there are three numbers N(3≤N≤100000), M(3≤M≤N), K(0≤K≤M), as described previously.
输出解释
For each case, print the Case #d: answer mod 1000000007 in each line.
输入样例
1 5 4 2
输出样例
Case #1: 5
提示
来自杭电HDUOJ的附加信息
| Author | UESTC |
| Recommend | wange2014 |
最后修改于 2020-10-25T23:22:09+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
| 时间上限 | 内存上限 |
| 2000/1000MS(Java/Others) | 65536/65536K(Java/Others) |
登陆或注册以提交代码