题目

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define int long long
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 200907;
int quick_pow(int a,int b,int c){
	int res=c;
	while(b){
		if(b&1){
			res=res*a%mod;
		}
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		if(c-b==b-a){
			int x=b-a;
			int res=(a%mod+(d-1)*x%mod)%mod;
			cout<<res<<endl;
		}
		else{
			int x=b/a;
			cout<<quick_pow(x,d-1,a)<<endl;
		}
	} 
    return 0;
}