HDU 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 3
1 2 10
0 0 0

sample output

2
5

code

#include<stdio.h>

int f[55];

int main()
{
    f[1]=1;
    f[2]=1;
    int a,b,n;
    while(scanf("%d%d%d",&a,&b,&n)!=EOF)
    {
        if(a==0&&b==0&&n==0)break;
        int i,j,beg,end,len,flag=0;
        for(i=3;i<=n&&flag==0;i++)
        {
            f[i]=(a*f[i-1]+b*f[i-2])%7;
            for(j=2;j<=i-1;j++)
            {
                if(f[j]==f[i]&&f[j-1]==f[i-1])//找到循环
                {
                    beg=j;
                    end=i;
                    len=end-beg;
                    flag=1;
                    break;
                }
            }
        }

        if(flag==0)printf("%d\n",f[n]);
        else printf("%d\n",f[beg+(n-end)%len]);
    }
    return 0;
}

规律：
f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7
A和B是固定的，f(n-1)和f(n-2)取值都是0，1，2….6中的一个，各有7种可能。所以f(n)最多只有49种。所以经过很多次运算，当所有可能的f(n)都出来一遍之后，在之后就会出现循环。