1 solutions

  • 0
    @ 2026-4-15 20:02:15
    #include <bits/stdc++.h>
    #define ll long long
    using namespace std;
    
    constexpr ll MOD = 200907;
    
    inline ll qp(ll a, ll b) {
    	ll ans = 1;
    	while (b) {
    		if (b & 1) {
    			ans = ans * a % MOD;
    		}
    		a = a * a % MOD;
    		b >>= 1;
    	}
    	return ans;
    }
    
    int main() {
    	register int t;
    	register ll a, b, c, k;
    	scanf("%lld", &t);
    	while (t--) {
    		scanf("%lld%lld%lld%lld", &a, &b, &c, &k);
    		if (c - b == b - a) {
    			ll ans = a + (c - b) * (k - 1) % MOD;
    			printf("%lld\n", ans);
    		} else {
    			a %= MOD;
    			ll ans = a * qp(c / b, k - 1) % MOD;
    			printf("%lld\n", ans);
    		}
    	}
    	return 0;
    }
    
    • 1

    Information

    ID
    195
    Time
    1000ms
    Memory
    512MiB
    Difficulty
    9
    Tags
    # Submissions
    97
    Accepted
    9
    Uploaded By