Numner 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 f(int a,int b,int n){
	if(n==1||n==2)
		return 1;
	else
		return(a*f(a,b,n-1)+b*f(a,b,n-2))%7;
}
int main(){
	int a,b,n;
	while(~scanf("%d%d%d",&a,&b,&n)){
		if(a==0&&b==0&&n==0)
			break;
		printf("%d\n",f(a,b,n%21));
	}
	return 0;
}


//请读者思考为什么要n%21(而不是其他，为什么n%7却不行)

代码二：

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