# 快速幂 jobdu-1447

## 问题

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.

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 one line for each test case, that is, the K-th number module (%) 200907.

2
1 2 3 5
1 2 4 5

5
16

## 代码

#include <iostream>
typedef long long ll;

ll arr[3];
const int MOD = 200907;

int fast_pow( ll a, ll b, int mod );

int main( void )
{
int t = 0;
std::cin >> t;
while( t-- )
{
for( int i = 0; i < 3; ++i )
std::cin >> arr[i];
int k = 0;
std::cin >> k;
int ans = 0;
if( arr[0] - arr[1] == arr[1] - arr[2] )
{
ans = (arr[0]%MOD + ((k-1)%MOD * (arr[1] - arr[0])%MOD)%MOD)%MOD;
}
else
{
ans = (arr[0]%MOD * fast_pow(arr[1]/arr[0], k-1, MOD))%MOD;
}
std::cout << ans << std::endl;
}
return 0;
}

int fast_pow( ll a, ll b, int mod )
{
int ans = 1;
ll w = a;// 这里小心，如果不是ll。可能 w%mod * w%mod这里就溢出了
while(b)
{
if(b%2)
ans = (ans * w)%mod;
w = (w%mod * w%mod)%mod;
b /=2 ;
}
return ans;
}


• 本文已收录于以下专栏：

## Exploit for CVE-2008-1447 - Kaminsky DNS Cache Poisoning Attack (DNS中毒工具)

/* * Exploit for CVE-2008-1447 - Kaminsky DNS Cache Poisoning Attack * * Compilation: * \$ gc...
• yatere
• 2011-05-14 03:50
• 1337

## jobdu 1103 二次方程计算器

//@auther zhou //@Number 201408070203 //@start time： //@finish time： /*@此处注意： 题目描述： 设计一个二次方程计算器 输入：...

## [Jobdu OJ] 1006 ZOJ问题

ZOJ问题

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)