Pagini recente » Cod sursa (job #1071739) | Cod sursa (job #216359) | Cod sursa (job #1048687) | Cod sursa (job #968902) | Cod sursa (job #177982)
Cod sursa(job #177982)
// http://infoarena.ro/problema/iepuri
#include <stdio.h>
#define Nmax 2000000001 //index 2000000005
int A, B, C, T;
long long F[Nmax];
long long N;
int main()
{
freopen("iepuri.in", "r", stdin);
freopen("iepuri.out", "w", stdout);
scanf("%d", &T);
for (int j = 0; j < T; j++)
{
scanf("%ld %ld %ld %d %d %d %ld", &F[0], &F[1], &F[2], &A, &B, &C, &N);
for (int i = 3; i <= N; i++)
F[i] = C * F[i - 3] + B * F[i - 2] + A * F[i - 1];
printf("%lld\n", F[N]);
}
return 0;
}