问题3089--Number Sequence

3089: Number Sequence

[命题人 : ]
时间限制 : 1.000 sec  内存限制 : 64 MB

题目描述

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.

样例输入 Copy

1 1 3
1 2 10
0 0 0

样例输出 Copy

2
5

来源/分类