Description
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
int
}
int
}
Input
Input starts with an integer T (≤ 125), 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 ≤ 10000 and the each of the others will be fit into a 32-bit integer.
Output
For each case, print the output of the given code. You can assume that we run the code in a compiler where no overflow occurs.
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
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
#include <cstdio>
using namespace std;
#define mode 10000007
int main()
{
int t,cas=0;
scanf("%d",&t);
int arr[10001]={0};
while(t--)
{
int a,b,c,d,e,f,n;
scanf("%d%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f,&n);
arr[0]=a%mode;
arr[1]=b%mode;
arr[2]=c%mode;
arr[3]=d%mode;
arr[4]=e%mode;
arr[5]=f%mode;
for(int i=6;i<=n;i++)
{
arr[i]=(arr[i-1]+arr[i-2]+arr[i-3]+arr[i-4]+arr[i-5]+arr[i-6])%mode;
}
printf("Case %d: %d\n",++cas,arr[n]);
}
return 0;
}