HDU1005-数学公式+循环节

Number Sequence

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

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

 

Recommend

JGShining

 

寻找循环是关键!题目不好。

#include <iostream>
using namespace std;

int main()
{
    int a,b,n,t,start,i,j,tag;
    int f[50];
    while(cin>>a>>b>>n&&a!=0)
    {
        f[0]=1; f[1]=1; start=0; tag=0;
        for(j=2;j<50;j++)
        {
            f[j]= (a*f[j-1]%7+b*f[j-2]%7)%7;
            for(i=j-1;i>0;i--)
            {                
                if(f[j]==f[i]&&f[j-1]==f[i-1])
                {
                    t=j-i;
                    start=i-1;
                    tag=1;
                    break;
                }
                if(tag) break;
            }
            
        }
        if(n-1<start) cout<<f[n-1]<<endl;
        else cout<<f[start+(n-1-start)%t]<<endl;
    }
    return 0;
}