Cod sursa(job #1519142)
Utilizator | Data | 6 noiembrie 2015 21:36:35 | |
---|---|---|---|
Problema | Iepuri | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<bits/stdc++.h>
using namespace std;
const int MOD=666013;
int i,n,t,a[666015],x,y,z;
int main()
{
ifstream cin("iepuri.in");
ofstream cout("iepuri.out");
ios_base::sync_with_stdio(0); cin.tie(0);
for(cin>>t;t;--t)
{
cin>>a[0]>>a[1]>>a[2]>>x>>y>>z>>n; n%=MOD-2;
for(i=3;i<=n;++i) a[i]=(1LL*a[i-1]*x+a[i-2]*y+a[i-3]*z)%MOD;
cout<<a[n]<<'\n';
}
return 0;
}