hdu 1005 Number Sequence（找周期）

Number Sequence

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

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
  
  

 

看了题目之后第一反应是有周期的，但是不知道周期是多少，刚开始试了100，wa了，后来又试了1000，过了~

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;

int main()
{
  int A,B,j,k,f[1010];
  long long n,i;
  while(~scanf("%d%d%lld",&A,&B,&n))
  {
      if(!A&&!B&&!n) break;
     f[1]=1;f[2]=1;
     A%=7;B%=7;
    for(i=3;i<=1000;i++)
    {

        f[i]=(A*f[i-1]+B*f[i-2])%7;
     if(f[i]==1&&f[i-1]==1)
        break;
    }
   i-=2;
   n%=i;
   f[0]=f[i];
    printf("%d\n",f[n]);

  }

    return 0;
}