#839478 (C++14) No.2211 Frequency Table of GCD

• 問題: No.2211 Frequency Table of GCD
• ユーザー: warabi0906
• 提出日時: 2023-02-11 09:17:58
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 374 ms / 2,000 ms
• コード長: 2,176 bytes
• コンパイル時間: 3,252 ms
• コンパイル使用メモリ: 230,200 KB
• 実行使用メモリ: 8,064 KB
• 最終ジャッジ日時: 2024-07-08 00:34:20
• 合計ジャッジ時間: 11,978 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

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

ソースコード

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
#include <bits/stdc++.h>
#include "atcoder/all"
#define debug cout << "OK" << endl;
template<typename T>
inline bool chmax(T& a, const T b) { if (a < b) { a = b; return true; } return false; }
template<typename T>
inline bool chmin(T& a, const T b) { if (a > b) { a = b; return true; } return false; }
inline int Code(char c) {
    if ('A' <= c and c <= 'Z')return (int)(c - 'A');
    if ('a' <= c and c <= 'z')return (int)(c - 'a');
    if ('0' <= c and c <= '9')return (int)(c - '0');
    assert(false);
}
using namespace std;
using namespace atcoder;
#define int long long
constexpr int MOD = 998244353;
constexpr int INF = (1LL << 63);
using minit = modint998244353;
template<typename T>
ostream& operator << (ostream& st, const vector<T>& v) {
    for (const T value : v) {
        st << value << " ";
    }
    return st;
}
template<typename T>
istream& operator >> (istream& st, vector<T>& v) {
    for (T& value : v) {
        st >> value;
    }
    return st;
}
struct edge {
    int to, cost;
};
int Rand() {
    return (rand() % 32768) * 32768 + (rand() % 32768);
}
int pow_(const int a, const int b, const int m = INF) {
    int res = 1;
    int base = a;
    for (int i = 0; i < 64; i++) {
        if (b & (1ll << i))res *= base;
        res %= m;
        base = base * base;
        base %= m;
    }
    return res;
}
//
//
class Solver {
public:
    int T;
    Solver() :T(1) {}
    ~Solver(){}
    void multi();
    void solve() const;
    void sp(int x)const;
};
void Solver::multi() {
    cin >> T;
    return;
}
void Solver::sp(const int x)const {
    cout << fixed << setprecision(x) << endl;
    return;
}
void Solver::solve() const {
    int N, M;
    cin >> N >> M;
    vector<int> A(N);
    cin >> A;
    vector<int> cnt(M + 1, 0);
    for (const int a : A) {
        cnt[a]++;
    }
    vector<int> ans(M + 1, 0);
    for (int k = M; 1 <= k; k--) {
        int pk = 0;
        minit res = 0;
        for (int e = 1; e * k <= M; e++) {
            pk += cnt[e * k];
            res -= ans[e * k];
        }
        res += pow_(2, pk, MOD) - 1;
        ans[k] = res.val();
    }
    for (int i = 1; i <= M; i++)
        cout << ans[i] << endl;
}
signed main() {
    Solver solver;
    //solver.multi();
    //solver.sp();
    for (int i = 0; i < solver.T; i++)
        solver.solve();
    return 0;
}
/*
* わらびのコードこーどすぺーす
 (σ･∀･)σｹﾞｯﾂ!!
*/
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX