結果

問題 No.2211 Frequency Table of GCD
ユーザー SnowBeenDidingSnowBeenDiding
提出日時 2023-02-10 22:06:28
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 967 ms / 2,000 ms
コード長 6,874 bytes
コンパイル時間 5,508 ms
コンパイル使用メモリ 316,020 KB
実行使用メモリ 5,760 KB
最終ジャッジ日時 2024-07-07 18:01:33
合計ジャッジ時間 15,265 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 28 ms
5,376 KB
testcase_04 AC 253 ms
5,376 KB
testcase_05 AC 426 ms
5,376 KB
testcase_06 AC 225 ms
5,376 KB
testcase_07 AC 411 ms
5,376 KB
testcase_08 AC 17 ms
5,376 KB
testcase_09 AC 13 ms
5,376 KB
testcase_10 AC 36 ms
5,376 KB
testcase_11 AC 24 ms
5,376 KB
testcase_12 AC 40 ms
5,376 KB
testcase_13 AC 210 ms
5,376 KB
testcase_14 AC 209 ms
5,376 KB
testcase_15 AC 131 ms
5,376 KB
testcase_16 AC 196 ms
5,376 KB
testcase_17 AC 376 ms
5,376 KB
testcase_18 AC 649 ms
5,632 KB
testcase_19 AC 652 ms
5,632 KB
testcase_20 AC 640 ms
5,760 KB
testcase_21 AC 644 ms
5,504 KB
testcase_22 AC 641 ms
5,504 KB
testcase_23 AC 20 ms
5,376 KB
testcase_24 AC 941 ms
5,632 KB
testcase_25 AC 21 ms
5,376 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 656 ms
5,632 KB
testcase_28 AC 967 ms
5,632 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
const long long MOD = 998244353;
// using mint = modint1000000007;
// const long long MOD = 1000000007;
// using mint = modint;//mint::set_mod(MOD);

#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repeq(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)
#define repreq(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); i--)
#define endl '\n'  // fflush(stdout);
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define sortr(v) sort(v, greater<>())
#define pb push_back
#define pob pop_back
#define mp make_pair
#define mt make_tuple
#define FI first
#define SE second
#define ALL(v) (v).begin(), (v).end()
#define INFLL 3000000000000000100LL
#define INF 1000000100
#define PI acos(-1.0L)
#define TAU (PI * 2.0L)

using namespace std;

typedef long long ll;
typedef pair<ll, ll> Pll;
typedef tuple<ll, ll, ll> Tlll;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef vector<ll> Vl;
typedef vector<Vl> VVl;
typedef vector<VVl> VVVl;
typedef vector<Tlll> VTlll;
typedef vector<mint> Vm;
typedef vector<Vm> VVm;
typedef vector<string> Vs;
typedef vector<double> Vd;
typedef vector<char> Vc;
typedef vector<bool> Vb;
typedef vector<Pll> VPll;
typedef priority_queue<ll> PQl;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQlr;

/* inout */
ostream &operator<<(ostream &os, mint const &m) {
    os << m.val();
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int n = v.size();
    rep(i, 0, n) { os << v[i] << " \n"[i == n - 1]; }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
    int n = v.size();
    rep(i, 0, n) os << v[i];
    return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> const &p) {
    os << p.first << ' ' << p.second;
    return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &mp) {
    for (auto &[key, val] : mp) {
        os << key << ':' << val << '\n';
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &st) {
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++) {
        os << *itr << (i + 1 != (int)st.size() ? ' ' : '\n');
        itr++;
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, multiset<T> &st) {
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++) {
        os << *itr << (i + 1 != (int)st.size() ? ' ' : '\n');
        itr++;
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, queue<T> q) {
    while (q.size()) {
        os << q.front();
        q.pop();
        os << " \n"[q.empty()];
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, stack<T> st) {
    vector<T> v;
    while (st.size()) {
        v.push_back(st.top());
        st.pop();
    }
    reverse(ALL(v));
    os << v;
    return os;
}
template <class T, class Container, class Compare>
ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) {
    vector<T> v;
    while (pq.size()) {
        v.push_back(pq.top());
        pq.pop();
    }
    os << v;
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &in : v) is >> in;
    return is;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

/* useful */
template <typename T>
int SMALLER(vector<T> &a, T x) {
    return lower_bound(a.begin(), a.end(), x) - a.begin();
}
template <typename T>
int orSMALLER(vector<T> &a, T x) {
    return upper_bound(a.begin(), a.end(), x) - a.begin();
}
template <typename T>
int BIGGER(vector<T> &a, T x) {
    return a.size() - orSMALLER(a, x);
}
template <typename T>
int orBIGGER(vector<T> &a, T x) {
    return a.size() - SMALLER(a, x);
}
template <typename T>
int COUNT(vector<T> &a, T x) {
    return upper_bound(ALL(a), x) - lower_bound(ALL(a), x);
}
template <typename T, typename S>
bool chmax(T &a, S b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T, typename S>
bool chmin(T &a, S b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
void press(T &v) {
    v.erase(unique(ALL(v)), v.end());
}
template <typename T>
vector<int> zip(vector<T> b) {
    pair<T, int> p[b.size() + 10];
    int a = b.size();
    vector<int> l(a);
    for (int i = 0; i < a; i++) p[i] = mp(b[i], i);
    sort(p, p + a);
    int w = 0;
    for (int i = 0; i < a; i++) {
        if (i && p[i].first != p[i - 1].first) w++;
        l[p[i].second] = w;
    }
    return l;
}
template <typename T>
vector<T> vis(vector<T> &v) {
    vector<T> S(v.size() + 1);
    rep(i, 1, S.size()) S[i] += v[i - 1] + S[i - 1];
    return S;
}

ll dem(ll a, ll b) { return ((a + b - 1) / (b)); }
ll dtoll(double d, int g) { return round(d * pow(10, g)); }
VVl gin(int n, int m = -1, bool zerodex = false, bool bi = true) {
    if (m == -1) m = n - 1;
    VVl gr(n);
    while (m--) {
        int a, b;
        cin >> a >> b;
        if (!zerodex) a--, b--;
        gr[a].pb(b);
        if (bi) gr[b].pb(a);
    }
    return gr;
}
unsigned long long randInt() {
    static unsigned int tx = 123456789, ty = 362436069, tz = 521288629,
                        tw = 88675123;
    unsigned long long tt = (tx ^ (tx << 11));
    tx = ty;
    ty = tz;
    tz = tw;
    return (tw = (tw ^ (tw >> 19)) ^ (tt ^ (tt >> 8)));
}

const double EPS = 1e-10;

void init() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(12);
}

// do {} while (next_permutation(ALL(vec)));

/********************************** START **********************************/

void sol();

int main() {
    init();
    int q = 1;
    // cin >> q;
    while (q--) sol();
    return 0;
}

/********************************** SOLVE **********************************/

vector<long long> divisor(long long n) {  // 約数列挙 O(√n)
    vector<long long> r;
    for (ll i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            r.pb(i);
            if (i * i != n) r.pb(n / i);
        }
    }
    sort(ALL(r));
    return r;
}

void sol() {
    int n, m;
    cin >> n >> m;
    Vi a(n);
    cin >> a;
    Vi ct(m);
    Vm ans(m);
    rep(i, 0, n) {
        auto v = divisor(a[i]);
        for (auto p : v) {
            ct[p - 1]++;
        }
    }
    rep(i, 0, m) ans[i] = pow_mod(2, ct[i], MOD);
    // cout << ans;
    rep(i, 0, m) ans[i]--;
    repreq(i, m - 1, 0) {
        int sa = i + 1, nw = i + sa;
        while (nw < m) {
            ans[i] -= ans[nw];
            nw += sa;
        }
    }
    rep(i, 0, m) cout << ans[i] << endl;
    // cout << ans;
}
0