杭电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 31 2 100 0 0

 

Sample Output

25

 

Author

CHEN, Shunbao

#include <iostream>

using namespace std;

int number(int a,int b,int n)
{
    if(n<=2)
        return 1;
    else
        return(a*number(a,b,n-1)+b*number(a,b,n-2))%7;
}

int main()
{
    int a,b,n;
    cin>>a>>b>>n;
    while(a!=0&&b!=0&&n!=0)
    {
        n=n%49;
        int result=number(a,b,n);
        cout<<result<<endl;
        cin>>a>>b>>n;
    }
    return 0;
}