2014216_ac_0ms_84k.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>

long w[21][21][21];

int main()
{
	int i, j, k;

	for(i = 0; i <= 20; i++)
		for(j = 0; j <= 20; j++)
			w[i][j][0] = w[0][i][j] = w[i][0][j] = 1;
	for(i = 1; i <= 20; i++)
		for(j = 1; j <= 20; j++)
			for(k = 1; k <= 20; k++)
				if(i<j&&j<k)
					w[i][j][k] = w[i][j][k-1]+w[i][j-1][k-1]-w[i][j-1][k];
				else
					w[i][j][k] = w[i-1][j][k]+w[i-1][j-1][k]+w[i-1][j][k-1]-w[i-1][j-1][k-1];
	while(scanf("%d%d%d",&i,&j,&k)==3&&(i!=-1||j!=-1||k!=-1))
	{
		if(i<=0||j<=0||k<=0)
		{
			printf("w(%d, %d, %d) = %ld\n",i,j,k,w[0][0][0]);
			continue;
		}
		if(i>20||j>20||k>20)
		{
			printf("w(%d, %d, %d) = %ld\n",i,j,k,w[20][20][20]);
			continue;
		}
	    printf("w(%d, %d, %d) = %ld\n",i,j,k,w[i][j][k]);
	}
	return 1;
}