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
  
  

第一个想到的就是递归。。。但是这个n太大，肯定会超时。还是得找规律。

显然这个公式最后对7取余，那么值为0-6也就是7种可能，那么f(n)有7*7=49种可能的值，找到那个循环的点也就是循环节就好了。

                                 /* 找到循环节 */
#include <stdio.h>
int main ( )
{
    int A , B , n , i , f[ 50 ] ;
    while ( ( scanf("%d %d %d", &A , &B , &n ) != EOF ) && ( A || B || n ) )
    {
        f[ 1 ] = 1 , f[ 2 ] = 1 ;
        for ( i = 3 ; i < 50 ; i ++ )
        {
            f[ i ] = ( ( A* f[ i-1 ] + B* f[ i-2 ] ) ) %7 ;
            if ( f[ i ] ==1 && f[ i-1 ] == 1 )
                break ;
        }
        n = n%( i-2 ) ; //i-2就是循环节
        if ( !n )
            printf("%d\n",f[ i-2 ] );  //类似于取余数正好整除
        else
            printf("%d\n", f[ n ] );   //否则算还差多少
    }
    return 0;
}