Cod sursa(job #2702242)
| Utilizator | Data | 3 februarie 2021 13:04:44 | |
|---|---|---|---|
| Problema | Iepuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
#define MOD 666013
using namespace std;
int past[3];
int main()
{
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
int t, x, y, z, a, b, c, n;
fin >> t;
while (t--)
{
fin >> x >> y >> z >> a >> b >> c >> n;
past[0] = x, past[1] = y, past[2] = z;
long long iep;
for (int i = 3; i <= n; i++)
{
iep = ((long long)a * past[2] + (long long)b * past[1] + (long long)c * past[0]) % MOD;
past[0] = past[1];
past[1] = past[2];
past[2] = iep;
}
fout << iep << '\n';
}
return 0;
}
