QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #736606 | #5661. Multi-Ladders | SanguineChameleon# | AC ✓ | 14ms | 10636kb | Python3 | 454b | 2024-11-12 11:59:40 | 2024-11-12 11:59:40 |
Judging History
answer
x=int(input())
mod = int(1e9+7)
for i in range(x):
n,k,lamb = map(int,input().split())
x = lamb-1
ladder = pow(lamb-1 + (lamb-2)**2,n-1,mod)
all_lads = pow(ladder,k,mod)
if (k%2)==1:
k_polyg = (-(pow(-x,k-1,mod)-1)*pow(mod-x-1,mod-2,mod))%mod
else:
k_polyg = ((pow(-x,k-1,mod)-1)*pow(mod-x-1,mod-2,mod))%mod
k_polyg = (x*(x+1)*k_polyg)%mod
ans = (k_polyg*all_lads)%mod
print(ans)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 11ms
memory: 10524kb
input:
1 2 3 3
output:
162
result:
ok single line: '162'
Test #2:
score: 0
Accepted
time: 14ms
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