Pagini recente » Cod sursa (job #840752) | Cod sursa (job #2307096) | Cod sursa (job #2668911) | Cod sursa (job #2629628) | Cod sursa (job #3203502)
#include <iostream>
#include <fstream>
#define MOD 666013
using namespace std;
ifstream fin("adiacenta1.txt");
ofstream fout("iepuri.out");
int X, Y, Z, A, B, C, N, T;
int I[2000000];
int main()
{
fin>>T;
for(int k=1;k<=T;k++)
{
fin>>X>>Y>>Z>>A>>B>>C>>N;
I[0] = X % MOD;
I[1] = Y % MOD;
I[2] = Z % MOD;
for(int i=3;i<=N;i++)
I[i] = A*I[i-1] % MOD + B*I[i-2] % MOD + C*I[i-3] % MOD;
cout<<I[N]<<'\n';
}
fin.close();
fout.close();
return 0;
}