fork(1) download
  1. #include <cstdio>
  2. #include <cstring>
  3. #define maxn 10003
  4. using namespace std;
  5. long long fn[maxn];
  6. int main() {
  7. int n, caseno = 0, cases,i;
  8. scanf("%d", &cases);
  9. while( cases-- ) {
  10. fn[6]=0;
  11. for (i=0;i<6;i++){
  12. scanf("%lld",&fn[i]); fn[i] = fn[i] % 10000007;
  13. fn[6]=(fn[6]+fn[i]) % 10000007;
  14. }
  15. scanf("%d",&n);
  16. for (i=7;i<=n;i++) fn[i]=(fn[i-1]+fn[i-2]+fn[i-3]+fn[i-4]+fn[i-5]+fn[i-6])% 10000007;
  17. //fn[i]=((2*fn[i-1]*10000007)-fn[i-7]) % 10000007;
  18. printf("Case %d: %lld\n", ++caseno, fn[n] );
  19. }
  20. return 0;
  21. }
Success #stdin #stdout 0s 3376KB
stdin
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 
stdout
Case 1: 216339
Case 2: 79
Case 3: 16636
Case 4: 6
Case 5: 54