Pagini recente » Cod sursa (job #3186911) | Cod sursa (job #623103) | Cod sursa (job #752962) | Cod sursa (job #2872200) | Cod sursa (job #2609144)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
int X, Y, Z, A, B, C, N, T, i, j, iep, zile[5], k, l, a[5];
const int MOD = 666013;
int main()
{
fin >> T;
for ( k = 1; k <= T; k++)
{
fin >> X >> Y >> Z >> A >> B >> C >> N;
zile[1] = Z; zile[2] = Y; zile[3] = X; a[1] = A; a[2] = B; a[3] = C; j = 0;
for ( i = 3; i <= N; i++)
{
iep = 0;
for ( l = 1; l <= 3; l++)
{
j++;
if (j==4)
{
j = 1;
}
iep = iep + a[l] * zile[j];
}
zile[j] = iep;
j--;
}
fout << iep%MOD << "\n";
}
fin.close();
fout.close();
}