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 <iostream>
using namespace std;

int main()
{
    int n; int a, b;
    cin >> a >> b >> n;
    while (a != 0 && b != 0 && n != 0)
    {
        int sum = 0;
        if (n == 1)
            cout << 1 << endl;
        else if (n == 1)
            cout << 1 << endl;
        else
        {    //value_n_1表示f(n-1)  value_n_2表示f(n-2)
            int sum; int value_n_1 = 1; int value_n_2 = 1;
            int N = n % 49;
            for (int i = 3; i <= N; i++)
            {
                sum = (a * value_n_1 + b * value_n_2) % 7;//sum表示f(n)
                value_n_2 = value_n_1;//更新f(n-2)的值，等于这一次循环的f(n-1)的值
                value_n_1 = sum;//更新f(n-1)的值，等于这一次循环的f(n)的值
            }
            cout << sum << endl;
        }
        cin >> a >> b >> n;
    }

    return 0;
}

本题初看是一道典型的递归题目，用递归也可以解出正确结果，但内存会爆，且时间也会超。同样即使改为循环，虽然使得内存合法，但时间依然会超。从n=100000000，来看本题必然涉及到算法的优化问题。
从取模的性质可知道f(n)、f(n-1)、f(n-2)小于7，其取值只有0~6这7中可能。因此f(n-1)和f(n-2)总共有49种可能，因此f(n)=f(n%49);
这里把用循环的形式写出的代码贴出来。