Pagini recente » Cod sursa (job #2999894) | Cod sursa (job #788004) | Cod sursa (job #3135438) | Cod sursa (job #597812) | Cod sursa (job #3192936)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
const int LMAX = 5005;
int main(){
short t;
long long a,b,c,n, v[3];
fin>>t;
for (int i = 0; i < t; i++) {
fin>>v[0]>>v[1]>>v[2]>>a>>b>>c>>n;
for (int j = 3 ; j <= n; j++) {
v[j%3] = (v[(j-1)%3] * a + v[(j-2)%3] * b + v[(j-3)%3] * c)%666013;
}
fout<<v[n%3]<<endl;
}
fin.close();
fout.close();
return 0;
}