Light OJ 1005 Rooks
来源:互联网 发布:数据建模分析师 编辑:程序博客网 时间:2024/06/10 01:18
1005 - Rooks
PDF (English) Statistics Forum
Time Limit: 1 second(s) Memory Limit: 32 MB
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
PROBLEM SETTER: JANE ALAM JAN
做法:先选出k行再一行放一个C(n,k),棋子在行中的位置不变,对行进行排序,共有A(n,k)种排法
所以共有A(n,k)*C(n,k)种摆放方法
import java.math.BigInteger;import java.util.Scanner;public class Main { static BigInteger[][] dp=new BigInteger[32][32]; static BigInteger[] mas=new BigInteger[32]; static BigInteger solve(int n,int k) { if(dp[n][k]!=null)return dp[n][k]; if(n<k)return BigInteger.ZERO; if(k==0)return BigInteger.ONE; if(k==1)return new BigInteger(Integer.toString(n)); return dp[n][k]=solve(n-1,k-1).multiply(new BigInteger(Integer.toString(n))); } static BigInteger jie(int n) { if(mas[n]!=null)return mas[n]; if(n==1||n==0)return BigInteger.ONE; else return mas[n]=jie(n-1).multiply(new BigInteger(Integer.toString(n))); } public static void main(String[] args) { Scanner scan=new Scanner(System.in); int t; int ca=1; t=scan.nextInt(); while(t--!=0) { int n,k; n=scan.nextInt(); k=scan.nextInt(); BigInteger b=solve(n,k); BigInteger c=jie(k); BigInteger ans=b.multiply(b).divide(c); if(k==0)ans=BigInteger.ONE; System.out.println("Case "+ca+": "+ans); ca++; } }}
- Light OJ 1005 Rooks
- 【瞎搞】 Light OJ 1005 - Rooks
- light oj 1005 - Rooks(组合数学)
- Light OJ 1005 - Rooks 数学题解
- light oj 1005 - Rooks (组合数学)
- light oj 1005 Rooks(组合数)
- light 1005 - Rooks
- light oj1005 Rooks
- Light Oj 1005
- 南邮 OJ 1390 Rooks
- light oj
- light oj
- Light OJ
- Light OJ
- UVa OJ 11134 - Fabled Rooks
- Light OJ 1000
- Light OJ 1001
- Light OJ 1008
- NAT技术与代理服务器
- 去掉.net页面中的input type=hidden name=__VIEWSTATE id=__VIEWSTATE.doc
- 淘宝轮播图效果
- java中使用final关键字修饰一个变量时,是引用不能变,还是引用的对象不能变?
- 在curl中设置自定义的HTTP头
- Light OJ 1005 Rooks
- 浅谈CMS垃圾收集器与G1收集器
- DFS Additive equations (累加)
- 数据库事务隔离级别-- 脏读、幻读、不可重复读
- 用js写的一个红绿灯程序
- @JSONField作用
- mysql 行级锁的使用以及死锁的预防
- C语言基础知识点(二)三大控制结构
- 叶子结点带权路径长度和(先序遍历法和层序遍历法)