#977589 (C++17) No.2763 Macaron Gift Box

• 問題: No.2763 Macaron Gift Box
• ユーザー: 👑 binap
• 提出日時: 2024-04-27 07:54:56
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 966 ms / 3,000 ms
• コード長: 3,476 bytes
• コンパイル時間: 4,864 ms
• コンパイル使用メモリ: 266,476 KB
• 最終ジャッジ日時: 2025-02-21 09:13:34
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 2
other	AC * 15

ソースコード

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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
using mint = modint998244353;
// Thanks for Luzhiled-san's website
// https://ei1333.github.io/luzhiled/snippets/math/formal-power-series.html
template< typename T >
struct FormalPowerSeries : vector< T > {
  using vector< T >::vector;
  using P = FormalPowerSeries;
  
  template<class...Args> FormalPowerSeries(Args...args): vector<T>(args...) {}
  FormalPowerSeries(initializer_list<T> a): vector<T>(a.begin(),a.end()) {}
  
  using MULT = function< P(P, P) >;
  static MULT &get_mult() {
    static MULT mult = [&](P a, P b){
        P res(convolution(a, b));
        return res;
    };
    return mult;
  }
  static void set_fft(MULT f) {
    get_mult() = f;
  }
  P operator+(const P &r) const { return P(*this) += r; }
  
  P operator+(const T &v) const { return P(*this) += v; }
  P operator*(const P &r) const { return P(*this) *= r; }
  P operator*(const T &v) const { return P(*this) *= v; }
  P &operator+=(const P &r) {
    if(r.size() > this->size()) this->resize(r.size());
    for(int i = 0; i < int(r.size()); i++) (*this)[i] += r[i];
    return *this;
  }
  
  P &operator+=(const T &r) {
    if(this->empty()) this->resize(1);
    (*this)[0] += r;
    return *this;
  }
  P &operator*=(const T &v) {
    const int n = (int) this->size();
    for(int k = 0; k < n; k++) (*this)[k] *= v;
    return *this;
  }
  P &operator*=(const P &r) {
    if(this->empty() || r.empty()) {
      this->clear();
      return *this;
    }
    assert(get_mult() != nullptr);
    return *this = get_mult()(*this, r);
  }
  
  P pre(int sz) const {
    return P(begin(*this), begin(*this) + min((int) this->size(), sz));
  }
  
  P diff() const {
    const int n = (int) this->size();
    P ret(max(0, n - 1));
    for(int i = 1; i < n; i++) ret[i - 1] = (*this)[i] * T(i);
    return ret;
  }
  
  P integral() const {
    const int n = (int) this->size();
    P ret(n + 1);
    ret[0] = T(0);
    for(int i = 0; i < n; i++) ret[i + 1] = (*this)[i] / T(i + 1);
    return ret;
  }
  // F(0) must not be 0
  P inv(int deg = -1) const {
    assert(((*this)[0]) != T(0));
    const int n = (int) this->size();
    if(deg == -1) deg = n;
    P ret({T(1) / (*this)[0]});
    for(int i = 1; i < deg; i <<= 1) {
      ret = (ret * T(2) + ret * ret * pre(i << 1) * T(-1)).pre(i << 1);
    }
    return ret.pre(deg);
  }
  // F(0) must be 1
  P log(int deg = -1) const {
    assert((*this)[0] == 1);
    const int n = (int) this->size();
    if(deg == -1) deg = n;
    return (this->diff() * this->inv(deg)).pre(deg - 1).integral();
  }
  // F(0) must be 0
  P exp(int deg = -1) const {
    assert((*this)[0] == T(0));
    const int n = (int) this->size();
    if(deg == -1) deg = n;
    P ret({T(1)});
    for(int i = 1; i < deg; i <<= 1) {
      ret = (ret * (pre(i << 1) + T(1) + ret.log(i << 1) * T(-1))).pre(i << 1);
    }
    return ret.pre(deg);
  }
};
using fps = FormalPowerSeries<mint>;
int main(){
    int n, k;
    cin >> n >> k;
    assert(1 <= k && k <= n && n <= 200000);
    fps f(n + 1);
    for(int i = 1; i <= n; i++){
        for(int j = 1; (long long)i * j * (k + 1) <= n; j++){
            f[i * j * (k + 1)] -= mint(j).inv();
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; i * j <= n; j++){
            f[i * j] += mint(j).inv();
        }
    }
    f = f.exp();
    for(int i = 1; i <= n; i++){
        cout << f[i].val();
        if(i == n) cout << "\n";
        else cout << " ";
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX