Cod sursa(job #2530108)
| Utilizator | Data | 24 ianuarie 2020 13:31:52 | |
|---|---|---|---|
| Problema | Iepuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
const int mod = 666013;
int a, b ,c, n, t;
int v[4];
void solve() {
for(int i = 3; i <= n; i++) {
v[3] = (a*v[2] + b*v[1] + c*v[0])%mod;
for(int k = 0; k < 3; k++)
v[k] = v[k+1];
}
fout << v[3] << '\n';
}
int main() {
fin >> t;
while(t--) {
fin >> v[0] >> v[1] >> v[2] >> a >> b >> c >> n;
solve();
}
}
