Number Sequence

Number Sequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 116792    Accepted Submission(s): 28416

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
  
  

 

Author

CHEN, Shunbao

 

Source

ZJCPC2004

 

看到那个n值了吗？如果对n不进行优化，保证超时！但是又不知

道怎么优化！后来网上说这个循环在49之内必会出现，因为7的余

数只能是0-6这7个数！

#include <stdio.h>
int main()
{
    int a,b,n,c[55],i,flag,k;
    while (scanf("%d%d%d",&a,&b,&n)&&(a&&b&&n))
    {
 
            c[1]=c[2]=1;
            for (i=3;i<=50;i++)
            {
                c[i]=(a*c[i-1]+b*c[i-2])%7;
                if (c[i]==1&&c[i-1]==1)
                {
                    break;
                }
            }
            flag=i-2;
        k=n%flag;
        if (k==0)
        {
            printf("%d\n",c[flag]);
        }
        else
        {
            printf("%d\n",c[k]);
        }
    }
}