1 人解决，10 人已尝试。
2 份提交通过，共有 60 份提交。
9.9 EMB 奖励。
2659. Chess
单点时限: 4.0 sec
内存限制: 256 MB
We have a chessboard, as the figure below, it shows the chessboard with dimension 1, 3, 5, 7 (We ignore the even number).Now, your task is to place K bishops on the n – dimension chessboard and satisfied that none of then attack each other ( A bishop can move to any distance in any of the four diagonal directions).
输入格式
The input contains two integers n ( 0 < n < 100 && n % 2 == 1 )and k ( 0<= k <= 10000) separated by a single space.
输出格式
Output the answer mod 100007.
样例
Input
7 3 1 1 1 0
Output
1038 1 1
创建: 14 年，8 月前.
修改: 6 年，7 月前.
最后提交: 10 年，5 月前.
来源: N/A
题目标签