Cod sursa(job #3169802)
Utilizator | Dediu Stefan zetef3 | Data | 16 noiembrie 2023 00:42:37 |
---|---|---|---|
Problema | Iepuri | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
#include <iostream>
#include <vector>
#define MOD 666013
using namespace std;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
int T;
vector<int> I;
void solve() {
int X,Y,Z,A,B,C,N;
f >> X >> Y >> Z >> A >> B >> C >> N;
I.resize(N+1);
I[0]=X;
I[1]=Y;
I[2]=Z;
for (int i=3;i<=N;i++)
I[i]=(A*I[i-1]%MOD + B*I[i-2]%MOD + C*I[i-3]%MOD)%MOD;
g << I[N] << '\n';
}
int main()
{
f >> T;
while (T--)
solve();
return 0;
}