lightoj--1005--Rooks(组合数)
来源:互联网 发布:中文logo设计软件 编辑:程序博客网 时间:2024/05/17 09:04
SubmitStatus
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 rookR1 and R2 are in attacking positions whereR1 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 putk 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 than1017.
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
Source
SubmitStatus
/*以前做组合数总是错,总算找到一种神器#include<stdio.h>#include<string.h>typedef long long LL;LL c[33][33];int main(){int t;scanf("%d",&t);int Case=1;for(int i=1;i<=30;i++){c[i][0]=c[i][i]=1;c[i][1]=i;for(int j=2;j<i;j++){c[i][j]=c[i-1][j]+c[i-1][j-1];}}while(t--){int n,k;LL sum;scanf("%d%d",&n,&k);if(n<k){printf("Case %d: 0\n",Case++);}else {sum=c[n][k]*c[n][k];for(int i=1;i<=k;i++)sum*=i;printf("Case %d: %lld\n",Case++,sum);}}}
- 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 [组合数学]
- 1005 - Rooks (组合数)
- LightOJ 1005 - Rooks (组合数学dp模拟)
- LightOJ 1005 - Rooks(DP)
- LightOJ - 1005 Rooks(统计)
- LightOJ 1005 - Rooks(计数)
- light oj 1005 Rooks(组合数)
- SGU 222 Little Rooks (组合数)
- SGU - 222 - Little Rooks (组合数)
- LightOJ 1005 Rooks 动态规划dp || 组合数学
- Android网络技术之WebView控件
- 2015-2016 ACM-ICPC, NEERC, Moscow Subregional Contest C题:Colder-Hotter [三分/交互题]
- 关于一些错误指示
- javascript中作用域和作用域链的例子
- UVA - 10558 A Brief Gerrymander
- lightoj--1005--Rooks(组合数)
- 聪明的投资者第一章
- DIV CSS简介
- LRU算法
- 杭电ACM2017-字符串统计
- 直角三角形
- 软件开发流程
- 第三十三篇:私人通迅录(有存储功能)
- 并查集学习笔记