QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#219380#5661. Multi-LaddersJenniferLing#AC ✓0ms3624kbC++17869b2023-10-19 13:57:372023-10-19 13:57:37

Judging History

你现在查看的是最新测评结果

  • [2023-10-19 13:57:37]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3624kb
  • [2023-10-19 13:57:37]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int M = 1e9 + 7;

int mypw(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) (res *= x) %= M;
    (x *= x) %= M;
    y >>= 1;
  }
  return res;
}

int mul(int x, int y) {
  return (x * y) % M;
}

void solve() {
  int n, k, l; cin >> n >> k >> l;
  if (l == 0 || l == 1) { 
    cout << "0\n";
    return;
  }
  if (l == 2) {
    if (k & 1) cout << "0\n";
    else cout << "1\n";
    return;
  }
  if (k & 1) cout << mul(mypw((mypw(l, 2) - 3 * l + M + 3) % M, (n - 1) * k), (mypw(l - 1, k) - (l - 1) + M) % M) << "\n";
  else cout << mul(mypw((mypw(l, 2) - 3 * l + M + 3) % M, (n - 1) * k), (mypw(l - 1, k) + l - 1) % M) << "\n";
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T = 1;
  cin >> T;
  while (T--) solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3624kb

input:

1
2 3 3

output:

162

result:

ok single line: '162'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3608kb

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