#893275 (C++17(gcc12)) No.2413 Multiple of 99

• 問題: No.2413 Multiple of 99
• ユーザー: 👑 AngrySadEight
• 提出日時: 2023-07-20 22:43:33
• 言語: C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 1,965 ms / 8,000 ms
• コード長: 2,497 bytes
• コンパイル時間: 13,684 ms
• コンパイル使用メモリ: 176,588 KB
• 最終ジャッジ日時: 2025-02-15 15:58:55
• ジャッジサーバーID （参考情報）: judge5 / 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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <atcoder/convolution>
#include <iostream>
#include <vector>
using namespace std;
using namespace atcoder;
using ll = long long;
ll mod = 998244353;
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> pow_poly(vector<ll> &vec, ll n, ll mod) {
    vector<ll> ret(0);
    if (n == 0) {
        ret.push_back(1);
    } else if (n % 2 == 1) {
        vector<ll> vec_conv = convolution<998244353>(vec, vec);
        vector<ll> vec_tmp = pow_poly(vec_conv, n / 2, mod);
        vector<ll> vec_nxt = convolution<998244353>(vec, vec_tmp);
        for (ll i = 0; i < vec_nxt.size(); i++) {
            ret.push_back(vec_nxt[i]);
        }
    } else {
        vector<ll> vec_conv = convolution<998244353>(vec, vec);
        vector<ll> vec_nxt = pow_poly(vec_conv, n / 2, mod);
        for (ll i = 0; i < vec_nxt.size(); i++) {
            ret.push_back(vec_nxt[i]);
        }
    }
    return ret;
}
int main() {
    ll N, K;
    cin >> N >> K;
    vector<ll> vec(10);
    for (ll i = 0; i < 10; i++) {
        vec[i] = 1;
    }
    vector<ll> ans_vec1 = pow_poly(vec, (N + 1) / 2, mod);
    vector<ll> ans_vec2 = pow_poly(vec, N / 2, mod);
    ll len1 = ans_vec1.size();
    ll len2 = ans_vec2.size();
    vector<ll> numsum(N * 9 + 2, 0);
    for (ll i = 0; i < 11; i++) {
        vector<ll> mod_vec1(len1);
        for (ll j = 0; j < len1; j++) {
            if (j % 11 == i) {
                mod_vec1[j] = ans_vec1[j];
            } else {
                mod_vec1[j] = 0;
            }
        }
        vector<ll> mod_vec2(len2);
        for (ll j = 0; j < len2; j++) {
            if (j % 11 == i) {
                mod_vec2[j] = ans_vec2[j];
            } else {
                mod_vec2[j] = 0;
            }
        }
        vector<ll> conv = convolution<998244353>(mod_vec1, mod_vec2);
        for (ll j = 0; j < conv.size(); j++) {
            numsum[j] = (numsum[j] + conv[j]) % mod;
        }
    }
    ll ans = 0;
    for (ll i = 0; i <= N * 9; i += 9) {
        ans = (ans + (numsum[i] * my_pow(i, K, mod))) % mod;
    }
    cout << ans << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX