lightoj - 1006 - Hex-a-bonacci

#include<bits/stdc++.h>
using namespace std;
long long ara[1000000];
long long a, b, c, d, e, f;
 long long fn( long long n ) {
    for(int i=0;i<=n;i++)
    {
        if(i==0)ara[i]=a;
        else if(i==1)ara[i]=b;
        else if(i==2)ara[i]=c;
        else if(i==3)ara[i]=d;
        else if(i==4)ara[i]=e;
        else if(i==5)ara[i]=f;
        else ara[i]=ara[i-1]+ara[i-2]+ara[i-3]+ara[i-4]+ara[i-5]+ara[i-6];
        ara[i] = ara[i] % 10000007;

    }
    return ara[n];
}
int main() {
    long long n, caseno = 0, cases;
    cin>>cases;
    while( cases-- ) {
        cin>>a>>b>>c>>d>>e>>f>>n;
        cout<< "Case "<<++caseno<< ": "<<fn(n) % 10000007<<endl;
    }
    return 0;
}