LOJ_1006 - Hex-a-bonacci

#include <stdio.h>
#define mod 10000007
#define LL  long long int


int main(int argc, char **argv){

    LL tc,ct=0 ;
    LL a,b,c,d,e,f,n;
    LL dp[11111] ;
    scanf("%lld",&tc) ;
    while(tc!=ct){

        scanf("%lld %lld %lld %lld %lld %lld %lld",&a,&b,&c,&d,&e,&f,&n) ;
        dp[0] = a ;
        dp[1] = b ;
        dp[2] = c ;
        dp[3] = d ;
        dp[4] = e ;
        dp[5] = f ;
        for(LL i=6;i<=n;i++){
            dp[i] = dp[i-1]+dp[i-2]+dp[i-3]+dp[i-4]+dp[i-5]+dp[i-6] ;
            dp[i]%=mod ;
        }
        printf("Case %lld: %lld\n", ++ct, dp[n]%mod);

    }

    return 0;
}