Pagini recente » Cod sursa (job #1016543) | Autentificare | Cod sursa (job #996823) | Clasament sm2 | Cod sursa (job #1569656)
#include<cstdio>
using namespace std;
#define mod 666013
int T;
int x, y, z;
int a, b, c;
int n;
int iep;
void read() {
if (freopen("iepuri.in", "rt", stdin));
if (freopen("iepuri.out", "wt", stdout));
}
int thisDay(int a, int b, int c, int x, int y, int z) {
return (c*x+b*y+a*z) % mod;
}
void close() {
fclose(stdin);
fclose(stdout);
}
int main() {
read();
if (scanf("%d", &T));
for (int i=1; i<=T; ++i) {
scanf("%d %d %d %d %d %d %d", &x, &y, &z, &a, &b, &c, &n);
iep = 0;
for (int j=3; j<=n; ++j) {
iep = thisDay(a,b,c,x,y,z); // Calculeaza nr. de iepuri din ziua j
x = y;
y = z;
z = iep;
}
printf("%d\n", iep);
}
close();
return 0;
}