HDU1005 Number Sequence

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

数据很明显不能直接递归，n最大为一亿，数据大只能找它的周期规律进行化简而不必真正计算到n。

#include<iostream>
using namespace std;
int a, b, n;
int c[100001];
int main()
{
	while (scanf("%d%d%d", &a, &b, &n)!=EOF)
	{
		if (a == 0 && b == 0 && n == 0)
			break;
		c[1] = c[2] = 1;
		int i;
		for (i = 3; i < 100001; i++)
		{
			c[i] = (a*c[i - 1] + b*c[i - 2]) % 7;
			if (c[i] == 1 && c[i - 1] == 1)        //前两项为1说明会开始一个新的周期，此时i-2为周期数
				break;
		}
		n = n % (i - 2);       //取余化简
		c[0] = c[i - 2];       //注意取余可能会有零
		cout << c[n] << endl;
	}
	return 0;
}