A - Rooks
来源:互联网 发布:apache 503错误 编辑:程序博客网 时间:2024/06/05 00:39
Description
A rook is a piece used in the game of chess which is played on a board of square grids. A rook can only move vertically or horizontally from its current position and two rooks attack each other if one is on the path of the other. In the following figure, the dark squares represent the reachable locations for rook R1 from its current position. The figure also shows that the rook R1 and R2 are in attacking positions where R1 and R3 are not. R2 and R3 are also in non-attacking positions.
Now, given two numbers n and k, your job is to determine the number of ways one can put k rooks on an n x n chessboard so that no two of them are in attacking positions.
Input
Input starts with an integer T (≤ 350), denoting the number of test cases.
Each case contains two integers n (1 ≤ n ≤ 30) and k (0 ≤ k ≤ n2).
Output
For each case, print the case number and total number of ways one can put the given number of rooks on a chessboard of the given size so that no two of them are in attacking positions. You may safely assume that this number will be less than 1017.
Sample Input
8
1 1
2 1
3 1
4 1
4 2
4 3
4 4
4 5
Sample Output
Case 1: 1
Case 2: 4
Case 3: 9
Case 4: 16
Case 5: 72
Case 6: 96
Case 7: 24
Case 8: 0
#include <cstdio>#include <cstring>#include <queue>#include <stack>#include <vector>#include <set>#include <algorithm>typedef long long lld;using std::min;lld f(int x,int y){lld sum=1;for(int i=1;i<=y;i++){sum*=x;x--;sum/=i;}return sum;}int main(){ int n,k; lld sum; int r; scanf("%d",&r); for(int s=1;s<=r;s++) { sum=1; scanf("%d%d",&n,&k); if(n < k ) sum = 0; else { for(int j=1;j<=k;j++) sum=sum*(n-j+1); sum*=f(n,k); } printf("Case %d: %lld\n",s,sum); } }
- A - Rooks
- A - Rooks
- Fabled Rooks
- Fabled Rooks
- Fabled Rooks
- HDU3160 Rooks
- UVA11134_Fabled Rooks
- Fabled Rooks
- uva 11134 Fabled Rooks
- Uva-11134-Fabled Rooks
- LightOJ 1005 - Rooks
- LightOJ 1005 - Rooks
- uva 11134 Fabled Rooks
- uva 11134 - Fabled Rooks
- UVA 11134 - Fabled Rooks
- UVa:11134 Fabled Rooks
- UVALive 6525 Attacking rooks
- UVALive 6525 Attacking rooks
- 利用uboot传递参数进行内核的不同配置
- SQL Server 的端口号
- 叠积木
- Timestamp
- FFmpeg API录制rtsp视频流
- A - Rooks
- Linux的USB器件驱动多接口设备初探
- 排序(拓扑排序)
- Poj 1201 Intervals
- Instr用法
- Hadoop 笔记 4 Hbase
- Cocos2d-x 萝莉快跑修改
- poj 3009 Curling 2.0
- Samba安装使用指南