水递推。。。
#include <cstdio>
using namespace std;
const int maxn = 21;
int dp[maxn][maxn][maxn];
int main()
{
for(int i = 0; i < maxn; i++)
for(int j = 0; j < maxn; j++)
dp[0][i][j] = dp[i][0][j] = dp[i][j][0] = 1;
for(int i = 1; i < maxn; i++)
for(int j = 1; j < maxn; j++)
for(int k = 1; k < maxn; k++) {
if(i < j && j < k)
dp[i][j][k] = dp[i][j][k-1] + dp[i][j-1][k-1] - dp[i][j-1][k];
else dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k] + dp[i-1][j][k-1] - dp[i-1][j-1][k-1];
}
int a, b, c;
while(~scanf("%d%d%d", &a, &b, &c) && (~a || ~b || ~c)) {
printf("w(%d, %d, %d) = ", a, b, c);
if(a <= 0 || b <= 0 || c <= 0) printf("1\n");
else if(a > 20 || b > 20 || c > 20) printf("%d\n", dp[20][20][20]);
else printf("%d\n", dp[a][b][c]);
}
return 0;
}