bzoj1037: [ZJOI2008]生日聚会Party

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cctype>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define dwn(i,s,t) for(int i=s;i>=t;i--)
#define clr(x,c) memset(x,c,sizeof(x))
int dp[305][155][25][25];
const int mod=12345678;
int main(){
    int n,m,s;scanf("%d%d%d",&n,&m,&s);
    dp[0][0][0][0]=1;
    rep(i,0,n+m-1) rep(j,0,n) rep(k,0,s) rep(t,0,s) if(dp[i][j][k][t]){
        if(i-j<m&&t<s) dp[i+1][j][max(k-1,0)][t+1]=(dp[i+1][j][max(k-1,0)][t+1]+dp[i][j][k][t])%mod;
        if(j<n&&k<s) dp[i+1][j+1][k+1][max(t-1,0)]=(dp[i+1][j+1][k+1][max(t-1,0)]+dp[i][j][k][t])%mod;
    }
    int ans=0;
    rep(i,0,s) rep(j,0,s) ans=(ans+dp[n+m][n][i][j])%mod;
    printf("%d\n",ans);
    return 0;
}