LightOJ 1005 Rooks 【排列组合】
来源:互联网 发布:最好的淘宝优惠券app 编辑:程序博客网 时间:2024/05/16 15:55
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.
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
比较好分析,结果是 从n 个里面选k个进行全排和进行组合的乘积..........
每一行,每一列最多有一个,那就先选出来k行,然后,n列中也要选出来k列,然后全部进行排列.......
早就找到思路了,但是处理比较复杂,需要考虑中间过程溢出,所以需要特殊处理.....
求组合数的时候,一边进行乘,同时进行除....
#include<stdio.h>typedef long long ll; ll A(int n,int m){ll sum=1;for(int i=n-m+1;i<=n;++i){sum*=i;}return sum;} ll C(int n,int m){ll sum=1;for(int i=n-m+1;i<=n;++i){sum*=i;if(m>1&&sum%m==0){sum/=m--;}}while(m>1){sum/=m--;}return sum;}int main(){int t,n,k;//freopen("shuju.txt","r",stdin);scanf("%d",&t);for(int i=1;i<=t;++i){scanf("%d%d",&n,&k);printf("Case %d: %lld\n",i,A(n,k)*C(n,k));}return 0;}
- LightOJ 1005 Rooks 【排列组合】
- LightOJ 1005 - Rooks (排列组合)
- LightOJ 1005 - Rooks
- LightOJ 1005 - Rooks
- lightoj 1005 Rooks
- Lightoj 1005 Rooks
- lightoj 1005 - Rooks
- LIGHTOJ 1005 – ROOKS
- LightOJ 1005 Rooks
- LightOJ 1005-Rooks
- lightOJ 1005 - Rooks
- lightoj 1005 - Rooks 【组合数学】
- LightOJ 1005 - Rooks(DP)
- lightoj 1005 - Rooks 【组合数学】
- LightOJ - 1005 Rooks(统计)
- LightOJ 1005 - Rooks(计数)
- LightOj 1005 - Rooks 区间dp
- LightOJ 1005 - Rooks 组合数
- 记事本打开文件乱码的问题
- 喷水装置-1
- 利用 GregorianCalendar 制作当前月的月历
- Leetcode -- Longest Valid Parentheses
- C++有符号和无符号之间的转换
- LightOJ 1005 Rooks 【排列组合】
- linux系统下的qt5安装
- BZOJ1021-1030
- php数据库编程:mysql扩展库操作数据库。
- Android四大图片缓存框架之-Fresco之initialize(二)
- 数据库SQL面试题七则
- Cocos2d-JS屏幕适配
- PhoneGap小窥(1)
- #include指令