Number Sequence |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 1803 Accepted Submission(s): 688 |
Problem Description
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 每48个一组循环,直接写会超时; |
Number Sequence(存在循环规律)
最新推荐文章于 2024-07-25 20:50:45 发布