#882406 (C++14) No.2351 Butterfly in Summer

• 問題: No.2351 Butterfly in Summer
• ユーザー: Cedeat
• 提出日時: 2023-06-17 11:04:09
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 17 ms / 2,000 ms
• コード長: 1,812 bytes
• コンパイル時間: 1,865 ms
• コンパイル使用メモリ: 166,084 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-25 02:41:29
• 合計ジャッジ時間: 2,583 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 21

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int P = 998244353;
template<const int T>
struct ModInt {
  const static int mod = T;
  int x;
  ModInt(int x = 0) : x(x % mod) {}
  int val() { return x; }
  constexpr int moded (int x) const {
    if (x < 0) {
      x += P;
    }
    if (x >= P) {
      x -= P;
    }
    return x;
  }
  ModInt operator + (const ModInt &a) const { int x0 = x; x0 += a.x; return ModInt(x0); }
  ModInt operator - (const ModInt &a) const { int x0 = x - a.x; return ModInt(x0 < mod ? x0 + mod : x0); }
  ModInt operator * (const ModInt &a) const { return ModInt(1LL * x * a.x % mod); }
  ModInt operator / (const ModInt &a) const { return *this * a.inv(); }
  void operator += (const ModInt &a) { x = moded(x + a.x); if (x >= mod) x -= mod; }
  void operator -= (const ModInt &a) { x -= a.x; if (x < 0) x += mod; }
  void operator *= (const ModInt &a) { x = 1LL * x * a.x % mod; }
  void operator /= (const ModInt &a) { *this = *this / a; }
  friend ostream &operator<<(ostream &os, const ModInt &a) { return os << a.x;}
  ModInt pow(int64_t n) const {
    ModInt res(1), mul(x);
    while(n){
      if (n & 1) res *= mul;
      mul *= mul;
      n >>= 1;
    }
    return res;
  }
  ModInt inv() const {
    int a = x, b = mod, u = 1, v = 0;
    while (b) {
      int t = a / b;
      a -= t * b; swap(a, b);
      u -= t * v; swap(u, v);
    }
    if (u < 0) u += mod;
    return u;
  }
};
typedef ModInt<P> mint; // mod1 || mod2
void Solve() {
    int n, k;
    cin >> n >> k;
    mint ans = k - 1;
    for (int i = 1; i <= n - 1; i++) {
        ans = ans / k;
    }
    cout << ans * n << '\n';
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int tt = 1;
    //cin >> tt;
    while (tt--) Solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX