HDU 1005 Number Sequence

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
  
  
  
  


  
  
  
  

   
   
#include <stdio.h>
int main()  
{  
    int a,b,n;  
    int c[10000];
    c[1] = c[2] = 1;  
    while(~scanf("%d %d %d",&a,&b,&n),a||b||n)  
    {  
        int i;  
        for(i=3; i<10000 ;i++)  
        {  
            c[i] = (a*c[i-1] + b*c[i-2]) % 7;  //找周期
            if(c[i] == 1 && c[i-1] == 1)              
                break;  
        }  
         n %= (i-2);                 
        c[0] = c[i-2];    
        printf("%d\n",c[n]);  
    }  
    return 0;  
}