HDU1005

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

#include<iostream>
using namespace std;
int list[10001];
int fun(int a, int b, int n)
{
	int t;
	list[1] = 1;
	list[2] = 1;
	for (int i = 3; i <= n; i++)
	{
		list[i] = (a*list[i - 1] + b*list[i - 2]) % 7;
		if (i > 3 && list[i] == 1 && list[i - 1] == 1)
		{
			t = i - 2;
			break;
		}
	}
	return t;
}
int main()
{
	int a, b;
	long long n;
	int t;
	while (cin >> a >> b >> n){
		if (n){
			t = 0;
			t = fun(a, b, 10000);
			list[0] = list[t];
			n %= t;
			cout << list[n] << endl;
		}
	}
}