hdu 2817 A sequence of numbers （快速幂）

A sequence of numbers

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3413    Accepted Submission(s): 1042

Problem Description

Xinlv wrote some sequences on the paper a long time ago, they might be arithmetic or geometric sequences. The numbers are not very clear now, and only the first three numbers of each sequence are recognizable. Xinlv wants to know some numbers in these sequences, and he needs your help.

 

Input

The first line contains an integer N, indicting that there are N sequences. Each of the following N lines contain four integers. The first three indicating the first three numbers of the sequence, and the last one is K, indicating that we want to know the K-th numbers of the sequence.

You can assume 0 < K <= 10^9, and the other three numbers are in the range [0, 2^63). All the numbers of the sequences are integers. And the sequences are non-decreasing.

 

Output

Output one line for each test case, that is, the K-th number module (%) 200907.

 

Sample Input

  
  

   
   2
1 2 3 5
1 2 4 5
  
  

 

Sample Output

  
  

   
   5
16
  
  

 

给出数列的前三项，数列要么是等差数列、要么是等比数列，求第K项。

注意数据范围

#include <iostream>
#include <algorithm>
using namespace std;
#define MOD 200907
long long quick_mode(long long a,long long b,long long m)
{
    long long ans=1;
    while (b)
    {
        if(b&1)
        {
            ans=ans*a%m;
            b--;
        }
        b/=2;
        a=a*a%m;
    }
    return ans;
}
int main()
{
    int t;
    double  a,b,c;
    long long k;
    cin>>t;
    while (t--)
    {
        cin>>a>>b>>c>>k;
        if(a+c==2*b)
        {
            long long a1=(long long)a;
            long long d=(long long )(b-a);
            cout<<(a1%MOD+((k-1)%MOD*d%MOD))%MOD<<endl;;
        }
        else
        {
            long long a1=(long long)a;
            double q1=b/a;
            long long q=(long long)q1;
            cout<<(a1%MOD*quick_mode(q%MOD, k-1, MOD)%MOD)%MOD<<endl;
        }
    }
    return 0;
}