Pagini recente » Cod sursa (job #583103) | Cod sursa (job #1681286) | Cod sursa (job #2879889) | Cod sursa (job #703093) | Cod sursa (job #2614246)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("iepuri.in");
ofstream out("iepuri.out");
const int ne=666013;
int t;
int main(){
in >>t;
while(t--){
long long int x[10030],a,b,c,n;
in >>x[0]>>x[1]>>x[2]>>a>>b>>c>>n;
if(n==2){
out <<x[0]+x[1]+x[2]<<"\n";
}else {
for(int i=3;i<=n;i++){
x[i]=x[i-1]*a+x[i-2]*b+x[i-3]*c;
}
out <<(x[n]%ne)<<"\n";
}
}
return 0;
}