Cod sursa(job #286533)
| Utilizator | Data | 23 martie 2009 21:30:41 | |
|---|---|---|---|
| Problema | Iepuri | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
//#include<algorithm>
//using namespace std;
#include<stdio.h>
#define MOD 666013
int t;
void solve(){
int i,j;
int x,y,z,a,b,c,n,aux;
scanf("%d",&t);
for(i=0; i<t; ++i){
scanf("%d%d%d%d%d%d%d",&x,&y,&z,&a,&b,&c,&n);
for(j=3; j<=n; ++j){
aux=((a*z)%MOD+(b*y)%MOD+(c*x)%MOD)%MOD;
x=y;
y=z;
z=aux;}
printf("%d\n",z);}}
int main(){
freopen("iepuri.in","r",stdin);
freopen("iepuri.out","w",stdout);
solve();
return 0;}
