SZ Fibonacci Sequence

描述

Fibonacci Sequence is familiar to you,right?Here comes the SZ fibonaccisequence,with the property like Formula 3.1.1

                        a,       n=1;

                        b,       n=2

F(n)=                   F(n-1)+F(n-2)      n>2 and n is odd;

                        F(n-1)+F(n-2)+F(n-3)  n>3and n is even;

 

Here a and b are constants.Gaven a,b and n,your task is to calculate the F(n)

 

输入

First line of input comes a positive integer T(T<=10),indicating the number of test cases.Each test casecontains three positive integer a,b and n(a<=10,b<=10,n<=30).

输出

print one linr containing an integer,i,e.F(n),for each test case.

样例输入

2
1 2 3
1 3 6

样例输出

3
24

#include<iostream>
using namespace std;

int main(){
	__int64 f[31];
	int i,t,n;
	cin>>t;
	while(t--){
		scanf("%I64d %I64d %d",&f[1],&f[2],&n);
		for(i=3;i<=n;i+=2){
			f[i]=f[i-1]+f[i-2];
			f[i+1]=f[i]+f[i-1]+f[i-2];
		}
		printf("%I64d\n",f[n]);
	}
	return 0;
}