Number Sequence（https://acs.jxnu.edu.cn/problem/HDU1005）

题目：

Number Sequence

 1000ms  32768K

描述：

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).

输入：

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.

输出：

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

翻译：

描述：

定义一个如下的数字序列：

f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
给出A，B，和n，计算f(n)的值。

输入：

输入包含多组测试用例，每个测试用例包含在一行的三个整数A, B 和 n  (1 <= A, B <= 1000, 1 <= n <= 100,000,000). 输入的结尾是三个零并且这个测试用例不被处理。

输出：

对于每个测试用例，在单行中输出f(n)的值。