对网上的代码做了些优化。。题解的话到处都有。
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll mod = 11380;
ll dp[31][11][11][11];
int l1, l2, l3, d;
int main()
{
scanf("%d%d%d%d", &l3, &l2, &l1, &d);
for (int i = 0; i <= d; i++)
dp[i][0][0][0] = 1;
for (int i = 1; i <= d; i++)
{
for (int j = 0; j <= l1; j++)
{
for (int k = 0; k <= l2; k++)
{
for (int q = 0; q <= l3; q++)
{
if (j + k + q < i)
{
dp[i][j][k][q] = dp[i - 1][j][k][q];
continue;
}
for (int t = 0; t <=j - 1; t++)
{
dp[i][j][k][q] +=(dp[i - 1][t][0][0] * dp[i][j - t - 1][k][q]);
}
for (int r = 0; r <=k - 1; r++)
{
for (int t = 0; t <= j; t++)
{
dp[i][j][k][q]+=(dp[i - 1][t][r][0] * dp[i][j - t][k - r - 1][q]);
}
}
for (int s = 0; s <= q - 1; s++)
{
for (int r = 0; r <= k; r++)
{
for (int t = 0; t <= j; t++)
{
dp[i][j][k][q]+=dp[i - 1][t][r][s] * dp[i][j - t][k - r][q - s - 1];
}
}
}
dp[i][j][k][q] %= mod;
}
}
}
}
if (d)
printf("%d\n", ((dp[d][l1][l2][l3] - dp[d - 1][l1][l2][l3]) % mod + mod) % mod);
else
printf("%d\n", dp[d][l1][l2][l3]);
}