QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#219867 | #5661. Multi-Ladders | ZIhan# | AC ✓ | 0ms | 3608kb | C++20 | 676b | 2023-10-19 19:19:09 | 2023-10-19 19:19:09 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IO ios::sync_with_stdio(0),cin.tie(0);
const int mod = 1e9 + 7;
using namespace std;
int powm(int x,int y){
int ret=1;
while(y){
if(y%2==1){
ret=ret*x%mod;
}
y>>=1;
x=x*x%mod;
}
return ret;
}
signed main(){
IO
int t;
cin>>t;
while(t--){
int n,k,l;
cin>>n>>k>>l;
int xx = powm((l*l-3*l+3+mod)%mod, (n-1)*k);
int yy = powm((l-1+mod)%mod,k-1);
int zz = (powm(powm((1-l+mod)%mod,k-2), mod-2) + l - 1 + mod) % mod;
cout<< xx*yy%mod*zz%mod<<'\n';
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3608kb
input:
1 2 3 3
output:
162
result:
ok single line: '162'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3576kb
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