Patti and Terri run a bar in which there are 15 stools. One day, Darrell entered the bar and found that the situation how customers chose the stools were as follows:
OOEOOOOEEEOOOEO
O means that the stool in a certain position is used, while E means that the stool in a certain position is empty (here what we care is not who sits on the stool, but whether the stool is empty).As the example we show above, we can say the situation how the 15 stools is used determines 7 intervals (as following):
OO E OOOO EEE OOO E O

Now we postulate that there are N stools and M customers, which make up K intervals. How many arrangements do you think will satisfy the condition?

There are multi test cases and for each test case:
Each case contains three integers N (0<N<=200), M (M<=N), K (K<=20).

For each test case print the number of arrangements as described above. (All answers is fit in 64-bit.)

3 1 3
4 2 4

1
2

2009 Multi-University Training Contest 5 - Host by NUDT

gaojie   |   We have carefully selected several similar problems for you:  2858 2860 2859 2856 2854 

#include<stdio.h>
#include<string.h>
__int64 a[220][220][22],b[220][220][22];
void init()
{
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
	a[1][0][1]=1;
	b[1][1][1]=1;
	int i,j,k;
	for(i=2;i<=200;i++)
	{
		for(j=0;j<=i;j++)
		{
			for(k=1;k<=i&&k<22;k++)
			{
				a[i][j][k]=a[i-1][j][k]+b[i-1][j][k-1];
				if(j)
					b[i][j][k]=a[i-1][j-1][k-1]+b[i-1][j-1][k];
			}
		}
	}
}
int main()
{
	init();
	int n,m,k;
	while(scanf("%d%d%d",&n,&m,&k)!=EOF)
	{
		printf("%I64d\n",a[n][m][k]+b[n][m][k]);
	}
}