Cod sursa(job #2187309)
Utilizator | Data | 26 martie 2018 13:18:35 | |
---|---|---|---|
Problema | Iepuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <bits/stdc++.h>
#define MOD 666013
using namespace std;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
long long t, x, y, z, a, b, c, n;
long long rez (long long n){
if (n==2) return z;
if (n==1) return y;
if (n==0) return x;
return rez(n-1)*a+rez(n-2)*b+rez(n-3)*c;
}
int main()
{
f>>t;
while (t--){
f>>x>>y>>z>>a>>b>>c>>n;
g<<rez(n)%MOD<<"\n";
}
return 0;
}