Pagini recente » Cod sursa (job #1464524) | Cod sursa (job #1695339) | Cod sursa (job #1528280) | Cod sursa (job #1838762) | Cod sursa (job #2196150)
#include <iostream>
#include <fstream>
#include <vector>
#define modulo 666013
#define nmax 200000000
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
int w[nmax];
int T,x,y,z,a,b,c,N,rez;
int answer(int N)
{
for(int j = 3; j <= N; j++)
{
w[j]=a*w[j-1]+b*w[j-2]+c*w[j-3];
}
return w[N];
}
int main()
{
fin>>T;
while(T--)
{
int u=0;
fin>>x>>y>>z>>a>>b>>c>>N;
w[u++]=x;
w[u++]=y;
w[u++]=z;
rez=answer(N);
fout<<rez%666013<<'\n';
}
return 0;
}