Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <stdio.h>
- using namespace std;
- long long int hexa[100000];
- long long int fn(long long int n) {
- if (n==0 || n==1 || n==2 || n==3 || n==4 || n==5) return hexa[n];
- if(hexa[n] != NULL) return hexa[n];
- hexa[n] = (fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6)) % 10000007;
- //hexa[n] = fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6);
- return hexa[n];
- }
- int main() {
- //freopen("input.txt", "r", stdin);
- int cases;
- cin >> cases;
- long long int n;
- for (int caseno = 1; caseno <= cases; ++caseno) {
- scanf("%lld %lld %lld %lld %lld %lld %lld", &hexa[0], &hexa[1], &hexa[2], &hexa[3], &hexa[4], &hexa[5], &n);
- //printf("%lld\n", fn(n));
- printf("Case %d: %lld\n", caseno, fn(n) % 10000007);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement