QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#102551 | #5661. Multi-Ladders | WPS# | TL | 2ms | 3456kb | C++17 | 927b | 2023-05-03 14:34:52 | 2023-05-03 14:34:56 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int power( int x , int y ){
// cout << x << "^" << y << "=";
x %= mod;
if( x < 0 ) x += mod;
int ans = 1;
while( y ){
if( y & 1 ) ans = ans * x % mod;
x = x * x % mod , y >>= 1;
}
// cout << ans << "\n";
return ans;
}
int inv( int x ){
return power(x , mod - 2 );
}
int sum( int a , int q , int n ){
// cout << a << " " << q << " " << n << "\n";
return a * ( power( q , n ) - 1 ) % mod * inv( q - 1 ) % mod;
}
int 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;
int ans = x;
// cout << x << "\n";
ans = ans * sum( (x-1)*power( x-2 , k-2 ) % mod , (x-1) * inv( (x-2)*(x-2) ) % mod , k / 2 ) % mod;
ans = ans * power( x * x - 3 * x + 3 , (n-1) * k ) % mod;
cout << ans << "\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3456kb
input:
1 2 3 3
output:
162
result:
ok single line: '162'
Test #2:
score: -100
Time Limit Exceeded
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...