lightOJ 1005 【规律题】
2015-10-24 18:06
295 查看
A - 楼下水题
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit Status Practice LightOJ
1005
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 R3are 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 nchessboard 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
代码:
这道题是规律题,首先先特判m==0的情况,如果m==0,则输出1;如果m>n则输出0;在其他的情况下应该是c n m,(从n行中找m行来放根),然后再用这个值乘以n*(n-1)*...*(n-m+1)【这个式子代表在m行放m个东西,使他们不在同一行同一列的总共的可能数】,最终得到的是总共的可能数!即为所求!
代码:
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit Status Practice LightOJ
1005
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 R3are 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 nchessboard 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
代码:
这道题是规律题,首先先特判m==0的情况,如果m==0,则输出1;如果m>n则输出0;在其他的情况下应该是c n m,(从n行中找m行来放根),然后再用这个值乘以n*(n-1)*...*(n-m+1)【这个式子代表在m行放m个东西,使他们不在同一行同一列的总共的可能数】,最终得到的是总共的可能数!即为所求!
代码:
#include <stdio.h> #include <string.h> #include <algorithm> typedef long long ll; using namespace std; ll T; ll n,m; ll N; int main() { scanf("%lld",&T); N=T; while(T--) { scanf("%lld%lld",&n,&m); printf("Case %lld: ",N-T); if(m==0) { printf("1\n"); continue; } if(m>n) { printf("0\n"); continue; } if(m==1) { printf("%lld\n",n*n); continue; } if(m==n) { ll sum=1; for(int i=1;i<=n;i++) { sum*=i; } printf("%lld\n",sum); continue; } else { ll sum=1; ll k=m; ll u=n; while(k--) { sum*=u; u--; } ll ans=sum; for(int i=1;i<=m;i++) { sum/=i; } printf("%lld\n",ans*sum); } } return 0; }
相关文章推荐
- android 解决fragment中有百度高德等地图,切换出现闪一下黑屏的问题
- screen命令的使用
- 图像滤镜艺术---Photoshop实现Instagram之Sierra滤镜
- QQ第三方登录
- windows屏幕保护程序opengl模板
- ubuntu php mysql
- java 下载功能的实现
- markdown使用手册
- css3 @-webkit-keyframes 这种格式什么意思
- 调用BPL包中的函数
- scala学习笔记(1):基本语法与容器
- Nubia Z5S(高通公司MSM8974) QHSUSB_BULK砖的方法节省模式(随着win7在恢复recovery分区案例)
- 详解JavaScript编程中的数组结构
- IOS笔记UI--main函数
- LeetCode Course Schedule BFS
- js写一个日期Ⅱ(完结)
- 关于MongoDB的几个重要的网站
- HDU 3062 Party 2-SAT
- elasticsearch中国字(mmseg)——手动添加字典
- jquery遍历