Pagini recente » Cod sursa (job #1590348) | Cod sursa (job #589694) | Cod sursa (job #964247) | Cod sursa (job #889222) | Cod sursa (job #2180315)
#include <fstream>
#include <vector>
#include <string>
#include <algorithm>
#include <iostream>
#define mod 666013
using namespace std;
int iepuri(int x,int y,int z,int a,int b,int c,int n){
if(n==1) return y;
if(n==2) return z;
int i=3;
while(i<=n){
int aux_x = x;
int aux_y = y;
x=y;
y=z;
z = (1LL*a*z + b*aux_y+c*aux_x)%mod;
i++;
}
return z;
}
int main(){
ifstream in("iepuri.in");
ofstream out("iepuri.out");
int nr_linii;
in>>nr_linii;
int x,y,z,a,b,c,n;
for(int i=0;i<nr_linii;i++){
in>>x>>y>>z>>a>>b>>c>>n;
out<<iepuri(x,y,z,a,b,c,n)<<endl;
}
}