2012省赛热身题 Climbing Stairs

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int f[105][105],a[105];
int main(){
	int t,icase=1;
	int n,k;
	int i,j;
	scanf("%d",&t);
	while(t--){
		memset(f,0,sizeof(f));
		scanf("%d%d",&n,&k);
		for(i=1;i<=k-1;i++)
			f[i][0]=1;
		for(i=2;i<=n;i++){
			if(i==k) continue;
			for(j=1;j<=i/3;j++){
				if(j>i-2*j) continue;
				f[i][j]=(f[i-1][j]+f[i-2][j-1])%10007;
			}
		}
		int sum=0;
		for(i=0;i<=n/3;i++)
			sum=(sum+f[n][i])%10007;
		printf("Case %d: %d\n",icase++,sum);
	}
	return 0;
} 



/**************************************
	Problem id	: SDUT OJ 2406 
	Result		: Accepted 
	Take Memory	: 496K 
	Take Time	: 0MS 
	Submit Time	: 2013-06-07 13:12:28  
**************************************/