2009 Multi-University Training Contest 1 题集（长期更新）

#include <bits/stdc++.h>
#define ll long long
#define mod 200907
using namespace std ;
ll quick(ll a , ll b , ll md)
{
ll res = 1 ;
a = a % md ;
while(b)
{
if(b%2) res = res * a % md ;
b/=2;
a = a * a % md ;
}
return res ;
}
int main()
{
ll a , b , c , solve;
ll q , d ,qqq;
int t ;
cin>>t;
while(t--)
{
cin>>a>>b>>c>>solve;
ll sum ;
if(b - a == c - b)
{
d = b - a ;
sum = a + (solve-1)*d;
cout<<sum%200907<<endl;
continue;
}
else if(b/a==c/b)
{
q = b/a;
qqq = quick(q,solve-1,mod);
sum = a*qqq;
cout<<sum%200907<<endl;
continue;
}
}
return 0 ;
}