2 2 2 3 2
1 3
#include<iostream> using namespace std; __int64 jiecheng(int n,int m) { int i; __int64 s1=1,s2=1; for(i=1;i<=m;i++) { s1*=(n-i+1); s2*=i; } return s1/s2; } int main() { int n,s,m,k; __int64 a[21],kk; a[2]=1; a[3]=2; for(s=4;s<21;s++) a[s]=(a[s-1]+a[s-2])*(s-1); cin>>k; while(k--) {cin>>n>>m; kk=a[m]*jiecheng(n,n-m); printf("%I64d\n",kk); } return 0; }
原文:http://blog.csdn.net/rememberautumn/article/details/22500985