#第二类斯特林数，组合计数#CF932E Teamwork

题目

求$$\sum _{i=1}^{n}C(n,i)i^k$$

---

分析

根据第二类斯特林数的性质可以得到
$$\sum _{i=1}^n\frac{n!}{i!(n-i)!}\sum _{j=0}^{k}S(k,j)\frac{i!}{(i-j)!j!}j!$$
$$=\sum _{i=1}^n\frac{n!}{(n-i)!}\sum _{j=0}^{k}S(k,j)\frac{1}{(i-j)!}$$
$$=\sum _{i=1}^n\sum _{j=0}^{k}S(k,j)\frac{n!}{(n-i)!(i-j)!}$$
$$=\sum _{i=1}^n\sum _{j=0}^{k}S(k,j)\frac{(n-j)!}{(n-i)!(i-j)!}\times \frac{n!}{(n-j)!}$$
$$=\sum _{j=0}^{k}S(k,j)\frac{n!}{(n-j)!}\sum _{i=1}^{n}C(n-j,n-i)$$
$$=\sum _{j=0}^{k}S(k,j)\frac{n!}{(n-j)!}{2}^{n-j}$$
但是如果$k=0$时答案要减1

---

代码

#include <cstdio>
#define rr register
using namespace std;
const int mod=1e9+7,inv=5e8+4;
int n,m,stir[5001][5001],ans;
inline signed mo(int x,int y){return x+y>=mod?x+y-mod:x+y;}
inline signed ksm(int x,int y){
	rr int ans=1;
	for (;y;y>>=1,x=1ll*x*x%mod)
	    if (y&1) ans=1ll*ans*x%mod;
	return ans;
} 
signed main(){
	scanf("%d%d",&n,&m); stir[0][0]=1;
	for (rr int i=1;i<=m;++i)
	for (rr int j=1;j<=i;++j)
	    stir[i][j]=mo(stir[i-1][j-1],1ll*stir[i-1][j]*j%mod);
	rr int jc=1,fac=ksm(2,n);
	for (rr int i=0;i<=m;++i){
		ans=mo(ans,1ll*jc*fac%mod*stir[m][i]%mod),
		jc=1ll*jc*(n-i)%mod,fac=1ll*fac*inv%mod; 
	}
	return !printf("%d",ans-(!m));
}