荔园在线
荔园之美，在春之萌芽，在夏之绽放，在秋之收获，在冬之沉淀
[回到开始]
[上一篇][下一篇]
发信人: westship (" "), 信区: ACMICPC
标 题: 2：Number Sequence
发信站: 荔园晨风BBS站 (Sat May 22 14:00:17 2004)
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
--
※ 来源:．荔园晨风BBS站 http://bbs.szu.edu.cn [FROM: 192.168.93.137]
[回到开始]
[上一篇][下一篇]
荔园在线首页 友情链接：深圳大学 深大招生 荔园晨风BBS S-Term软件 网络书店