Number Sequence（HDU-1005）

Problem Description
A number sequence is defined as follows:

f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.

Given A, B, and n, you are to calculate the value of f(n).

Input
The input consists of multiple test cases. Each test case contains 3 integers A, B and n on a single line (1 <= A, B <= 1000, 1 <= n <= 100,000,000). Three zeros signal the end of input and this test case is not to be processed.

Output
For each test case, print the value of f(n) on a single line.

Sample Input
1 1 3
1 2 10
0 0 0

Sample Output
2
5
这道题其实是有规律的，f(n)对7求余一共有7种情况，俩之和对7求余所以共有49种情况，如果直接递归来算的话就会出现内存超限的问题，因此在计算之后会发现有规律，a,b,各有7种情况。

#include<stdio.h>
int a,b;
long long f(int n)
{
	if(n==1||n==2)
		return 1;
	return ((a%7)*f(n-1)+(b%7)*f(n-2))%7;
}
int main()
{
	int n;
	while(scanf("%d%d%d",&a,&b,&n),a!=0||b!=0||n!=0)
	{
		printf("%lld\n",f(n%49));
	}
	return 0;
}