lightoj 1006

B - Hex-a-bonacci

Time Limit:500MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  LightOJ 1006

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 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 (≤ 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;  
}