车同行同列不能放
N*N格子 放K个车 求方法数
先取K行放车Cnk
再对于这K行中的每一行的取一列 就是Ank列
ans=Cnk*Ank
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <deque>
#include <map>
#define cler(arr, val) memset(arr, val, sizeof(arr))
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long LL;
const int MAXN = 230+1;
const int MAXM = 140000;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
LL getc(LL n,int k)
{
LL sum=1;
for(int i=1;i<=k;i++)
{
sum=sum*(n-i+1)/i;
}
return sum;
}
LL geta(LL n,LL k)
{
LL sum=1;
while(k--)
{
sum*=n;
n--;
}
return sum;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
LL n,t,k,cas=1;
cin>>t;
while(t--)
{
cin>>n>>k;
if(k>n) printf("Case %lld: 0\n",cas++);
else
{
LL c=getc(n,k);
LL a=geta(n,k);
printf("Case %lld: %lld\n",cas++,a*c);
}
}
return 0;
}