Cod sursa(job #3312981)
| Utilizator | Data | 1 octombrie 2025 15:21:37 | |
|---|---|---|---|
| Problema | Iepuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
#define MOD 666013
int T,A,B,C,X,Y,Z,N;
int pd[100001];
ifstream f("iepuri.in");
ofstream g("iepuri.out");
int main()
{ f>>T;
while(T--)
{ f>>A>>B>>C>>X>>Y>>Z>>N;
pd[0]=X,pd[1]=Y,pd[2]=Z;
for(int i=3;i<=N;i++) pd[i]=((A*pd[i-1])%MOD+(B*pd[i-2])%MOD+(C*pd[i-3])%MOD)%MOD;
g<<pd[N]<<'\n';
}
return 0;
}
