light1005 - Rooks【排列组合】
2015-10-24 21:39
344 查看
1005 - Rooks
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.
![](https://img-blog.csdn.net/20151024213848823?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center)
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.
Each case contains two integers n (1 ≤ n ≤ 30) and k (0 ≤ k ≤ n2).
题意:将k个棋子放入n*n的棋盘中使任意两个棋子不在同一行或同一列求有多少种放法
解题思路:将k个棋子放入n行n列第一行的棋子有n种放法第二行棋子有n-1种放法第k行棋子有n-k+1种放法从n行中选取k行放棋子所以有总放法数目为Cnk*Ank
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#define eps 1e-8
using namespace std;
int main()
{
int t,i,j,test=1;
long long n,k,ans;
scanf("%d",&t);
while(t--){
scanf("%lld%lld",&n,&k);
double m=1;
if(n<k)ans=0;
else {
for(j=k,i=n;i>=n-k+1;--i,--j){
m*=((1.0*i)/(1.0*j));
}
m=m+eps;
ans=(long long)m;
for(i=n;i>=n-k+1;--i){
ans*=i;
}
}
printf("Case %d: %lld\n",test++,ans);
}
return 0;
}
![]() | PDF (English) | Statistics | Forum |
Time Limit: 1 second(s) | Memory Limit: 32 MB |
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 | Output for Sample Input |
8 1 1 2 1 3 1 4 1 4 2 4 3 4 4 4 5 | Case 1: 1 Case 2: 4 Case 3: 9 Case 4: 16 Case 5: 72 Case 6: 96 Case 7: 24 Case 8: 0 |
题意:将k个棋子放入n*n的棋盘中使任意两个棋子不在同一行或同一列求有多少种放法
解题思路:将k个棋子放入n行n列第一行的棋子有n种放法第二行棋子有n-1种放法第k行棋子有n-k+1种放法从n行中选取k行放棋子所以有总放法数目为Cnk*Ank
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#define eps 1e-8
using namespace std;
int main()
{
int t,i,j,test=1;
long long n,k,ans;
scanf("%d",&t);
while(t--){
scanf("%lld%lld",&n,&k);
double m=1;
if(n<k)ans=0;
else {
for(j=k,i=n;i>=n-k+1;--i,--j){
m*=((1.0*i)/(1.0*j));
}
m=m+eps;
ans=(long long)m;
for(i=n;i>=n-k+1;--i){
ans*=i;
}
}
printf("Case %d: %lld\n",test++,ans);
}
return 0;
}
相关文章推荐
- 人生的高境界 - 无所谓
- 个人家园 - 永久免费ASP个人主页空间
- L.WuBi - 发布个最好用的在线五笔编码查询、五笔拆字图解
- 用hta实现制作的无殇 - 快书V1.1打包下载了第1/2页
- Windows SP2 免激活安装版 - DeepinXP PLUS V2 测试版 下载
- 超星图书浏览器(SSReader) v4.00 Bulid 070511 - 数字图书阅览器 下载
- Convenientfox v0.0.1.3 - 基于FireFox的浏览器 下载
- GX::Transcoder v3.20.51.3687 - 音频视频文件转换全能王 下载
- 某市大型汽车网 - vip代码提供下载了
- CSS属性 - white-space 空白属性使用说明
- 测试模式 - XSL教程 - 5
- 选择模式 - XSL教程 - 2
- 匹配模式 - XSL教程 - 4
- XPath入门 - XSL教程 - 3
- 强烈推荐 - Ajax 技术资源中心
- filewipe - 商用级文件擦除工具 提供下载了
- Javascript - HTML的request类
- 关于XSL - XSL教程
- JS创建优美的页面滑动块效果 - Glider.js
- 脚本中出现 window.open() access is denied - 拒绝访问 情况一则及分析