Pagini recente » Cod sursa (job #2252266) | Cod sursa (job #2386324) | Cod sursa (job #804094) | Cod sursa (job #230417) | Cod sursa (job #3244748)
#include<iostream>
#include<fstream>
using namespace std;
const int Mod = 666013;
int x, y, z, a, b, c, n, t;
ifstream fin("iepuri.in");
ofstream fout ("iepuri.out");
void CalculeazaIepuri();
int main()
{
fin >> t;
for (int i = 1; i <= t; ++i)
{
fin >> x >> y >> z >> a >> b >> c >> n;
CalculeazaIepuri();
}
}
void CalculeazaIepuri()
{
int zp;
for (int i = 3; i <= n; ++i)
{
zp = (((a * z) % Mod + (b * y) % Mod) % Mod + (x * c) % Mod) % Mod;
if (i == n)
fout << zp << '\n';
else
{
x = y;
y = z;
z = zp;
}
}
}