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
题意:斐波那契公式,只不过改变了A,B,求第n个f的值,但是这个n相当大,所以暴力肯定过不了,刚开始打了暴力代码测试了下,发现有一定的规律,就是出现1,1的时候会循环,又发现在后面那个数是7的倍数的时候,是在后面出现