結果

問題 No.2763 Macaron Gift Box
コンテスト
ユーザー AngrySadEight
提出日時 2025-11-09 10:21:59
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,366 ms / 3,000 ms
コード長 6,352 bytes
コンパイル時間 7,397 ms
コンパイル使用メモリ 196,216 KB
実行使用メモリ 28,876 KB
最終ジャッジ日時 2025-11-09 10:25:30
合計ジャッジ時間 19,768 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }

vector<ll> fps_inv(vector<ll> &f) {
    // f の mod 998244353 での fps_inv を返す
    ll n = f.size();
    ll new_n = 1;
    ll log = 0;
    while (new_n < n) {
        new_n *= 2;
        log++;
    }
    for (ll i = n; i < new_n; i++) {
        f.push_back(0);
    }
    // g[0] の項
    vector<ll> g = {inv(f[0], mod2)};
    ll now = 1;
    for (ll i = 0; i < log; i++) {
        now *= 2LL;
        vector<ll> fsub(now);
        for (ll j = 0; j < now; j++) {
            fsub[j] = f[j];
        }
        vector<ll> h1 = convolution(g, fsub);
        vector<ll> h2(now, 0);
        h2[0] = 2;
        for (ll j = 0; j < now; j++) {
            h2[j] = (h2[j] + mod2 - h1[j]) % mod2;
        }

        vector<ll> h3 = convolution(g, h2);
        for (ll j = 0; j < now / 2; j++) {
            g[j] = h3[j];
        }
        for (ll j = now / 2; j < now; j++) {
            g.push_back(h3[j]);
        }
    }
    vector<ll> new_g(0);
    for (ll i = 0; i < n; i++) {
        new_g.push_back(g[i]);
    }
    return new_g;
}

vector<ll> fps_log(vector<ll> &f){
    ll n = f.size();
    vector<ll> f_inv = fps_inv(f);
    vector<ll> f_diff(n);
    for (ll i = 1; i < n; i++){
        f_diff[i - 1] = (f[i] * i) % mod2;
    }
    vector<ll> log_int = convolution(f_diff, f_inv);

    vector<ll> ret(n);
    for (ll i = 1; i < n; i++){
        ret[i] = (log_int[i - 1] * inv(i, mod2)) % mod2;
    }
    return ret;
}

vector<ll> fps_exp(vector<ll> &f){
    // f の mod 998244353 での fps_exp を返す
    ll n = f.size();
    ll new_n = 1;
    ll log = 0;
    while (new_n < n) {
        new_n *= 2;
        log++;
    }
    for (ll i = n; i < new_n; i++) {
        f.push_back(0);
    }
    // g[0] の項
    vector<ll> g = {1};
    ll now = 1;
    for (ll i = 0; i < log; i++) {
        now *= 2LL;
        vector<ll> fsub(now);
        for (ll j = 0; j < now; j++) {
            fsub[j] = f[j];
        }
        fsub[0] = (fsub[0] + 1) % mod2;
        vector<ll> ext_g(now);
        for (ll j = 0; j < now / 2; j++){
            ext_g[j] = g[j];
        }
        vector<ll> g_log = fps_log(ext_g);
        for (ll j = 0; j < now; j++){
            fsub[j] = (fsub[j] + mod2 - g_log[j]) % mod2;
        }
        vector<ll> h = convolution(fsub, g);
        for (ll j = now / 2; j < now; j++) {
            g.push_back(h[j]);
        }
    }
    vector<ll> new_g(0);
    for (ll i = 0; i < n; i++) {
        new_g.push_back(g[i]);
    }
    return new_g;
}

int main() {
    ll N, K;
    cin >> N >> K;
    
    vector<ll> log_f(N + 1, 0);
    // 分子の計算
    for (ll i = 1; i <= N; i++){
        for (ll j = 1; j * i <= N; j++){
            log_f[i * j] += (mint(1) / mint(j)).val();
            log_f[i * j] %= mod2;
        }
    }
    // 分母の計算
    for (ll i = K + 1; i <= N; i += (K + 1)){
        for (ll j = 1; j * i <= N; j++){
            log_f[i * j] += (mod2 - (mint(1) / mint(j)).val());
            log_f[i * j] %= mod2;
        }
    }
    vector<ll> Ans = fps_exp(log_f);
    for (ll i = 1; i <= N; i++){
        cout << Ans[i] << " ";
    }
    cout << endl;
}
0