SZ斐波拉契数列

Problem Description

Fibonacci sequence is familiar to you, right? Here comes the SZ Fibonacci sequence, with the property like the following formula.
F(n)= a (n=1)
F(n)= b (n=2)
F(n)= F(n-1)+F(n-2), n>2 and n is odd
F(n)= F(n-1)+F(n-2)+F(n-3), n>2 and n is even
Here a and b are constants. Given a,b,and n, your task is to calculate the F(n).

Input

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

Output

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

Sample Input

2
1 2 3
1 3 6

Sample Output

3
24

#include<iostream>
#include<cstdio>
using namespace std;
int a,b;
int dg(int );
int main()
{
//freopen("a.txt","r",stdin);
int c,n;
scanf("%d",&n);
while(n--)
{
scanf("%d%d%d",&a,&b,&c);
printf("%d\n",dg(c));
}
return 0;
}
int dg(int c)
{
if(c==1) return a;
if(c==2) return b;
if(c>2&&c%2==0) return dg(c-1)+dg(c-2)+dg(c-3);
if(c>2&&c%2!=0) return dg(c-1)+dg(c-2);
}