QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #626808 | #5661. Multi-Ladders | KowerKoint# | AC ✓ | 15ms | 10636kb | Python3 | 269b | 2024-10-10 13:12:13 | 2024-10-10 13:12:14 |
Judging History
answer
T=int(input())
for t in range(T):
N,K,C=map(int,input().split())
mod=10**9+7
ans=-C*(C-1)*(C-2)-(1-C)**3*(1-pow(1-C,K-3,mod))%mod
if K%2:
ans=-ans
ans%=mod
ans*=pow((C-1)*(C-1)-(C-2),K*(N-1),mod)
ans%=mod
print(ans)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 15ms
memory: 10616kb
input:
1 2 3 3
output:
162
result:
ok single line: '162'
Test #2:
score: 0
Accepted
time: 15ms
memory: 10636kb
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 349400141 243010659 52489881 53690844 176686901 218103365 558243892 991895211 693053429 883715672 80402569 0 0 311752813
result:
ok 20 lines