QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #526062 | #5661. Multi-Ladders | solar_express# | AC ✓ | 15ms | 10712kb | Python3 | 398b | 2024-08-21 10:34:49 | 2024-08-21 10:34:49 |
Judging History
answer
T = int(input())
mod = 1000000007
for _ in range(T):
n,k,l = map(int, input().split())
coef = ((l-2)**2+l-1) % mod
b = (l-1)**2%mod
u = (k//2)
base = u if b == 1 else (pow(b,u,mod)-1) * pow(b-1,-1,mod) % mod
base = base * l * (l-2) % mod
if k & 1:
base = base * (l-1) % mod
else:
base += l
print(base * pow(coef, (n-1)*k, mod) % mod)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 15ms
memory: 10712kb
input:
1 2 3 3
output:
162
result:
ok single line: '162'
Test #2:
score: 0
Accepted
time: 11ms
memory: 10624kb
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