杭电1005—Number Sequence

Number Sequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 163107    Accepted Submission(s): 40107

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
  
  
  
  


  
  

题目意思挺简单，一开始用了递归超时，又用容器一个一个求还是超时，上网搜了一下大牛的题解，才知道其实这道题是找规律的。

因为%7有7种可能，而式子又由f(n-1)和f(n-2)决定，又a%c + b%c = (a+b)%c，可以推知最多有7*7=49种可能，在50内找到循环节，用n%循环节即可把数组缩小到50以内。

下面贴上AC代码。