Pagini recente » Cod sursa (job #2194750) | Cod sursa (job #699566) | Cod sursa (job #3184295) | Cod sursa (job #2968113) | Cod sursa (job #3124466)
#include <fstream>
#define mod 666013
using namespace std;
ifstream fin ("iepuri.in");
ofstream fout("iepuri.out");
int t,x,y,z,a,b,c,n;
long long iepuri(int n)
{
if(n<0)
return 0;
else if(n==0)
return x;
else if(n==1)
return y;
else if(n==2)
return z;
else
return a*iepuri(n-1)%mod+b*iepuri(n-2)%mod+c*(n-3)%mod;
}
int main()
{
fin>>t;
for(int i=1;i<=t;i++)
{
fin>>x>>y>>z>>a>>b>>c>>n;
fout<<iepuri(n)<<'\n';
}
return 0;
}