1243.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

P

#include <stdio.h>

int ans[31][31];

int calc( int g, int l )
{
	if( l == 0 ) return g;
	if( g == 1 ) return 1;
	if( ans[g][l] <0 )
		ans[g][l] = 1 + calc( g-1, l-1 ) + calc( g-1, l );
	return ans[g][l];
}


int main()
{
	int g, l, d=1;
	for(g=0;g<=30;g++)
	for(l=0;l<=30;l++)
		ans[g][l] = -1;

	while(1)
	{
		scanf( "%d%d", &g, &l );
		if( g == 0 && l == 0 )
			break;
		printf( "Case %d: %d\n", d++, calc(g,l) );
	};

	return 0;
}