Submission #8531641

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long

int n, k, mod, C[333][333], f[333][333], g[333][333];

template<class T1,class T2> void U(T1 &x,T2 y){
	x=(x+y)%mod;
}

int main(){
	cin>>n>>k>>mod;
	for (int i=0;i<=n;++i){
		C[i][0]=1;
		for (int j=1;j<=i;++j)
			C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
	}
	for (int i=0;i<=k;++i){
		f[1][i]=1;
		g[1][i]=i+1;
	}
	for (int i=2;i<=n+1;++i){
		for (int j=0;j<=k;++j){
			for (int i1=1;i1<i;++i1){
				int i2=i-i1;
				if (j) U(f[i][j],(ll)C[i-2][i1-1]*f[i1][j]%mod*g[i2][j-1]);
			}
			g[i][j]=f[i][j];
			if (j) U(g[i][j],g[i][j-1]);
		}
	}
	cout<<f[n+1][k]<<endl;
}

Submission Info

Judge Result