QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#183968 | #5661. Multi-Ladders | MaGnsi0# | WA | 0ms | 3708kb | C++17 | 841b | 2023-09-20 05:10:29 | 2023-09-20 05:10:30 |
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;
int64_t val = m * (m - 1) % MOD;
int64_t x = (2 * (m - 1) + (m - 2) * (m - 3) % MOD + MOD - 1) % MOD;
int64_t one = val * power(x, n - 1) % MOD;
int64_t ans = one * power(m - 1, k - 3) % MOD * power(power(x, n - 1), k - 1) % MOD;
cout << ans << "\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3708kb
input:
1 2 3 3
output:
162
result:
ok single line: '162'
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3648kb
input:
20 2 3 3 1 3 3 10 3 0 10 3 2 1 21 2 1 22 0 2000 15000 2000 12000 30000 200000 1000000000 3 3 2 1000000000 3 2 3 100000000 1000000000 1000000000 10 1000000000 3 100000000 2 1000000000 100000000 1 1000000000 10 1 1000000000 100000000 1 1000 100000000 1000000000 1000000000 0 1000000000 1000000000 1 100...
output:
162 6 0 2 2 0 276470632 285647315 52489881 186358669 304930780 187785751 422872637 787551670 258401658 851695173 122393842 0 0 798130793
result:
wrong answer 4th lines differ - expected: '0', found: '2'