QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#102954 | #5661. Multi-Ladders | WPS | AC ✓ | 2ms | 3400kb | C++17 | 910b | 2023-05-03 20:36:51 | 2023-05-03 20:36:54 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+7;
int power( int x , int y ){
x %= mod;
if( x < 0 ) x += mod;
int ans = 1ll;
while( y ){
if( y & 1ll ) ans = ans * x % mod;
x = x * x % mod , y >>= 1ll;
}
return ans;
}
int32_t main(){
ios::sync_with_stdio(false) , cin.tie(nullptr) , cout.tie(nullptr);
int T , n , k , x ;
cin >> T;
for( ; T ; T -- ){
cin >> n >> k >> x;
if( x < 2 ){
cout << "0\n";
continue;
}
int ans = 1;
ans = x * power( x - 1 , k-2 ) % mod;
ans = power(x-1,k);
if( k & 1 ) ans = ( ans - x + 1 + mod ) % mod;
else ans = ( ans + x - 1 + mod ) % mod;
ans = ans * power( x * x - 3 * x + 3 , (n-1) * k ) % mod;
cout << ans << "\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3400kb
input:
1 2 3 3
output:
162
result:
ok single line: '162'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3400kb
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