版本7和9间的区别 (跳过第2版)
于2006-04-23 17:38:55修订的的版本7
大小: 1815
编辑: 49
备注:
于2008-02-23 15:35:51修订的的版本9
大小: 1817
编辑: localhost
备注: converted to 1.6 markup
删除的内容标记成这样。 加入的内容标记成这样。
行号 3: 行号 3:
http://acm.zju.edu.cn/show_problem.php?pid=2105
行号 32: 行号 34:
---written by proby--- /*written by proby*/
行号 86: 行号 88:
http://acm.zju.edu.cn/show_problem.php?pid=2105

Number Sequence

http://acm.zju.edu.cn/show_problem.php?pid=2105

Time limit: 1 Seconds

Memory limit: 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).

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

2. Output

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

3. Sample Input

{{{1 1 3 1 2 10 0 0 0 }}}

4. Sample Output

zju2105 (2008-02-23 15:35:51由localhost编辑)

ch3n2k.com | Copyright (c) 2004-2020 czk.