Cod sursa(job #1404885)
Utilizator | Data | 28 martie 2015 17:12:48 | |
---|---|---|---|
Problema | Iepuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("ieouri.out");
const int MOD = 666013;
int T, N, X, Y, Z, A, B, C;
int sol;
int main()
{
fin >> T;
while (T--)
{
fin >> X >> Y >> Z >> A >> B >> C >> N;
sol = 0;
for (int i = 3; i <= N; ++i)
{
sol = ((A * Z) % MOD + (B * Y) % MOD + (C * X) % MOD) % MOD;
X = Y;
Y = Z;
Z = sol;
}
fout << sol << '\n';
}
fin.close();
fout.close();
return 0;
}