QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#183971 | #5661. Multi-Ladders | MaGnsi0# | WA | 1ms | 3596kb | C++17 | 903b | 2023-09-20 05:24:30 | 2023-09-20 05:24:31 |
Judging History
answer
/**
* author: MaGnsi0
* created: 19.09.2023 23:58:10
**/
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
int64_t power(int64_t b, int64_t p) {
int64_t ans = 1; b %= MOD;
while (p) {
if (p & 1) { ans = ans * b % MOD; }
b = b * b % MOD;
p /= 2;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int T;
cin >> T;
while (T--) {
int64_t n, k, m;
cin >> n >> k >> m;
if (m < 2) {
cout << 0 << "\n";
continue;
}
int64_t val = m * (m - 1) % MOD;
int64_t x = (2 * (m - 1) + (m - 2) * (m - 3) % MOD + MOD - 1) % MOD;
x = power(x, n - 1);
int64_t ans = val * x % MOD * power(m - 1, k - 2) % MOD * power(x, k - 1) % MOD;
cout << ans << "\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3596kb
input:
1 2 3 3
output:
324
result:
wrong answer 1st lines differ - expected: '162', found: '324'