提交时间:2025-10-21 16:52:17

运行 ID: 38718

#include <bits/stdc++.h> using namespace std; #define int long long const int mod = 998244353; int T, n, k, p; int qpow(int a, int b) { int ans = 1; while (b) { if (b & 1) ans = ans * a % mod; b >>= 1; a = a * a % mod; } return ans; } void solve() { cin >> n >> k >> p; if (n % k == 0) { int t = n / k, sum = 0, inv = qpow(n % mod, mod - 2); for (int j = 0; j < t; j++) sum = (sum + 1 - j % mod * (k % mod) % mod * p % mod * inv % mod) % mod; cout << sum * qpow(p, mod - 2) % mod << '\n'; return; } } signed main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> T; while (T--) solve(); return 0; }