杭电1005_Number Sequence

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
  
  

#include<stdio.h>
int main()
{
    int A,B,n,i=1;
    int a[50];
    a[1]=a[2]=1;
    while(scanf("%d%d%d",&A,&B,&n)&&!(A==0&&B==0&&n==0)){
        for(i=3;i<50;i++){
            a[i]=(A*a[i-1]+B*a[i-2])%7;
            
            if(a[i]==1&&a[i-1]==1){
                break;
            }
        }
        i-=2;
        n=n%i;
        if(n==0){
            n=i;
        }
        printf("%d\n",a[n]);
    }
}