Advertisement
ahamed210

hexa

Mar 18th, 2021
619
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.82 KB | None | 0 0
  1. #include <iostream>
  2. #include <stdio.h>
  3.  
  4. using namespace std;
  5.  
  6. long long int hexa[100000];
  7. long long int fn(long long int n) {
  8.     if (n==0 || n==1 || n==2 || n==3 || n==4 || n==5) return hexa[n];
  9.     if(hexa[n] != NULL) return hexa[n];
  10.     hexa[n] = (fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6)) % 10000007;
  11.     //hexa[n] = fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6);
  12.     return hexa[n];
  13. }
  14.  
  15. int main() {
  16.     //freopen("input.txt", "r", stdin);
  17.     int cases;
  18.     cin >> cases;
  19.     long long int n;
  20.     for (int caseno = 1; caseno <= cases; ++caseno) {
  21.         scanf("%lld %lld %lld %lld %lld %lld %lld", &hexa[0], &hexa[1], &hexa[2], &hexa[3], &hexa[4], &hexa[5], &n);
  22.         //printf("%lld\n", fn(n));
  23.         printf("Case %d: %lld\n", caseno, fn(n) % 10000007);
  24.     }
  25.     return 0;
  26. }
  27.  
  28.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement