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

思路：因为是对7取模，所以是一个8*8的数表，数表的起始位置和周期记录一下即可

#include <cstdio>
#include <algorithm>
using namespace std;
int f[105]={0,1,1};
int main()
{
    int a,b,n;
    while(scanf("%d%d%d",&a,&b,&n)==3){
     if(a==0&&b==0&&n==0)
         break;
     int s=0,i,j;
      for(i=3;i<=n;i++)
      {
          f[i]=(a*f[i-1]+b*f[i-2])%7;
          for( j=2;j<i;j++)
          {
              if(f[i]==f[j]&&f[i-1]==f[j-1]){//找到周期s 起始位置j
                s=i-j;
                break;
              }

          }
          if(s>0)
            break;
      }
      if(s>0)
      printf("%d\n",f[(n-j)%s+j]);
      else
      printf("%d\n",f[n]);

    }
}