hdu 1005 循环节

Number Sequence

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

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
   
   

   
   
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <ctime>
using namespace std;

#define LL long long
#define clr(s,x) memset(s,x,sizeof(s))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1

const double PI = acos(-1.0);
const int mod = 7;
const int maxn = 1e5+10;

int ans[maxn];

int main()
{
    int a,b,n;
    while(cin>>a>>b>>n){
        if(a==0&&b==0&&n==0)break;
        ans[1]=ans[2]=1;
        int cnt=0;
        for(int i=3;i<maxn;i++){
            ans[i]=(a*ans[i-1]+b*ans[i-2])%mod;
            if(ans[i]==1&&ans[i-1]==1)break;
            cnt=i;
        }
        n%=(cnt-1);
        ans[0]=ans[cnt-1];
        cout<<ans[n]<<endl;
    }

    return 0;
}