问题
分析
设i个人排列的名次可能性有f(i)种,现在一共是n个人,第一位是i(1<=i<=n)人并列,所以剩下的n-i重新排列,可能数 f ( n ) = ∑ i = 1 n C ( n , i ) f ( n − i ) , f ( 0 ) = 1 f(n)=\sum_{i=1}^nC(n,i)f(n-i),f(0)=1 f(n)=∑i=1nC(n,i)f(n−i),f(0)=1
#include <cstring>
#include <cstdio>
#include <vector>
#include <iostream>
#include <cmath>
#include <vector>
#include <utility>
using namespace std;
typedef long long ll;
const int maxn=1005;
int kase=0,T,n,f[maxn],C[maxn][maxn];
void calC(){
for(int i=1;i<=1000;++i) C[i][0]=C[i][i]=1;
for(int i=1;i<=1000;++i){
int t=(i>>1);
for(int j=1;j<=t;++j){
C[i][i-j]=C[i][j]=(C[i-1][j]+C[i-1][j-1])%10056;
}
}
}
void calf(){
f[0]=1;
for(int i=1;i<=1000;++i){
for(int j=1;j<=i;++j){
f[i]+=C[i][j]*f[i-j];
f[i]%=10056;
}
// f[i]=f[i]%10056;
}
}
int main(void){
calC();
calf();
scanf("%d",&T);
while(kase<T){
scanf("%d",&n);
printf("Case %d: %d\n",++kase,f[n]);
}
}