[sourcecode language="c"]
/*****************************
* *
* Author: Md. Rana Mahmud *
* r4n4m4hmud.wordpress.com *
* *
*****************************/
#include <cstdio>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
long long data[100005];
long long a, b, c, d, e, f;
long long fn( long long n )
{
if( n == 0 ) return a;
else if( n == 1 ) return b;
else if( n == 2 ) return c;
else if( n == 3 ) return d;
else if( n == 4 ) return e;
else if( n == 5 ) return f;
else if(data[n]!=-1) return data[n];
else
{
data[n] = ( fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6) )%10000007;
return data[n];
}
}
int main()
{
long long n, caseno = 0, cases;
cin>>cases;
while( cases-- )
{
memset(data,-1,sizeof(data));
cin>>a>>b>>c>>d>>e>>f>>n;
cout<<"Case "<<++caseno<<": "<<fn(n)%10000007<<endl;
}
}
[/sourcecode]
কোন মন্তব্য নেই:
একটি মন্তব্য পোস্ট করুন