uva6469禁位排序

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
long long p[20];
long long c[20][20];
long long getans(int n,int m){
	long long ans=0;
	for(int i=0;i<=m;i++){
		ans+=(p[n-i]*c[m][i]*(i%2?-1:1));
	}
	return ans;
}
int main(){
//	freopen("in.txt","r",stdin);
	p[1]=p[0]=1;
	for(int i=2;i<=17;i++)p[i]=p[i-1]*i;
	for(int i=0;i<=17;i++)for(int j=0;j<=i;j++)c[i][j]=p[i]/p[j]/p[i-j];
	int t;
	cin>>t;
	while(cin>>t){
		int m,k;
		cin>>m>>k;
		cout<<t<<" "<<getans(m,k)<<endl;
	}
	return 0;
}

禁位排序问题请参考http://www.cnki.com.cn/Article/CJFDTotal-HHCZ200002006.htm