寒假翻译题训练 1月22日

链接：https://acs.jxnu.edu.cn/problem/HDU1005

题目：

描述：

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

输入：

输入包含多组样例。每一组样例包含3个整型A，B和n ，且A，B，n均位于同一行(1 <= A, B <= 1000, 1 <= n <= 100,000,000).当输入的整型均为0时，输入停止。

输出：

对于每一组样例，输出f(n)的值。