杭电oj 1005

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

f(n)比7小,所以f(n - 1)和f(n - 2)也比7小,他们的取值是[0,6]的整数,A和B的值是固定的
f(n)最多7*7=49种值,所以每给一次A,B都只要算前49个数,用f(n)等于前49个中的一个

#include <stdio.h>
int main(void){
    int a, b, n, c[49] = {1,1};
    while(scanf("%d%d%d", &a, &b, &n) && (a || b || n)){
        for(int i = 2;i < 49;i++)
            c[i] = (a*c[i - 1] + b*c[i - 2])%7;
        printf("%d\n", c[(n - 1)%49]);    //数组从0开始,n-1对49取模就行
    }
    return 0;
}