http://blog.csdn.net/wjzdmr/article/details/39050839

Given a code (not optimized), and necessary inputs, you have to find the output of the code for the inputs. The code is as follows:

int a, b, c, d, e, f;
int fn( int n ) {
    if( n == 0 ) return a;
    if( n == 1 ) return b;
    if( n == 2 ) return c;
    if( n == 3 ) return d;
    if( n == 4 ) return e;
    if( n == 5 ) return f;
    return( fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6) );
}
int main() {
    int n, caseno = 0, cases;
    scanf("%d", &cases);
    while( cases-- ) {
        scanf("%d %d %d %d %d %d %d", &a, &b, &c, &d, &e, &f, &n);
        printf("Case %d: %d\n", ++caseno, fn(n) % 10000007);
    }
    return 0;
}

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case contains seven integers, a, b, c, d, e, f and n. All integers will be non-negative and 0 ≤ n ≤ 10000and the each of the others will be fit into a 32-bit integer.

Output

For each case, print the output of the given code. The given code may have integer overflow problem in the compiler, so be careful.

Sample Input

5

0 1 2 3 4 5 20

3 2 1 5 0 1 9

4 12 9 4 5 6 15

9 8 7 6 5 4 3

3 4 3 2 54 5 4

Sample Output

Case 1: 216339

Case 2: 79

Case 3: 16636

Case 4: 6

Case 5: 54

题意：优化题中给的代码，使之在规定的时间内求出答案；

思路：不会用快速幂矩阵，不过给的数挺小的，可以用递归来求解；

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[11000];
int main()
{
	int t, a,b,c,d,e,f,n,i,j,h=1;
	scanf("%d",&t);
	while(t--)
	{
		memset(dp,0,sizeof(dp));
		scanf("%d%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f,&n);
		dp[0]=a%10000007;
		dp[1]=b%10000007;
		dp[2]=c%10000007;
		dp[3]=d%10000007;
		dp[4]=e%10000007;
		dp[5]=f%10000007;
			for(i=6;i<=n;i++)
			{
				for(j=i-6;j<i;j++)
				{
					dp[i]+=dp[j];
					dp[i]%=10000007;
				}
			}
	printf("Case %d: %d\n",h++,dp[n]);
	}
	return 0;
}