A - Number Sequence

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).

第一种解法：

#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;
}

第二种解法：

#include<iostream>
using namespace std;
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(cin>>a>>b>>n,a||b||n)
    {
        cout<<f(a,b,n%49)<<endl;
    }
    return 1;
}