QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #239030 | #5661. Multi-Ladders | ItsJerr# | WA | 0ms | 3612kb | C++20 | 528b | 2023-11-04 18:09:53 | 2023-11-04 18:09:53 |
Judging History
answer
/*input
1
2 3 3
*/
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
int pw(int a, int b)
{
if (b == 1) return a;
if (b == 0) return 1;
int mid = pw(a, b / 2);
mid = mid * mid % mod;
if (b & 1) return mid * a % mod;
return mid;
}
main() {
cin.tie(0)->sync_with_stdio(0);
int t;
cin >> t;
while (t-- > 0)
{
int n, k, A;
cin >> n >> k >> A;
cout << A*(A-2)%mod*pw(A-1,k-2)%mod*pw(pw((pw(A-2,2)+A-1)%mod,n-1),k)%mod << '\n';
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
input:
1 2 3 3
output:
162
result:
ok single line: '162'
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3608kb
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 0 0 0 388318872 891305474 52489881 186358669 176686901 502286001 558243892 873610512 67213250 423049 869536635 0 0 145046875
result:
wrong answer 7th lines differ - expected: '349400141', found: '388318872'