結果
問題 | No.2211 Frequency Table of GCD |
ユーザー |
|
提出日時 | 2023-02-10 21:33:21 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 2,781 bytes |
コンパイル時間 | 1,853 ms |
コンパイル使用メモリ | 197,868 KB |
最終ジャッジ日時 | 2025-02-10 12:19:04 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include <bits/stdc++.h>using i64 = long long;template<class T>T power(T a, i64 b) {T res = 1;for (; b; b /= 2, a *= a) {if (b % 2) {res *= a;}}return res;}template<int P>struct MInt {int x;MInt() : x{} {}MInt(i64 x) : x{norm(x % P)} {}int norm(int x) const {if (x < 0) {x += P;}if (x >= P) {x -= P;}return x;}int val() const {return x;}MInt operator-() const {MInt res;res.x = norm(P - x);return res;}MInt inv() const {assert(x != 0);return power(*this, P - 2);}MInt &operator*=(const MInt &rhs) {x = 1LL * x * rhs.x % P;return *this;}MInt &operator+=(const MInt &rhs) {x = norm(x + rhs.x);return *this;}MInt &operator-=(const MInt &rhs) {x = norm(x - rhs.x);return *this;}MInt &operator/=(const MInt &rhs) {return *this *= rhs.inv();}friend MInt operator*(const MInt &lhs, const MInt &rhs) {MInt res = lhs;res *= rhs;return res;}friend MInt operator+(const MInt &lhs, const MInt &rhs) {MInt res = lhs;res += rhs;return res;}friend MInt operator-(const MInt &lhs, const MInt &rhs) {MInt res = lhs;res -= rhs;return res;}friend MInt operator/(const MInt &lhs, const MInt &rhs) {MInt res = lhs;res /= rhs;return res;}friend std::istream &operator>>(std::istream &is, MInt &a) {i64 v;is >> v;a = MInt(v);return is;}friend std::ostream &operator<<(std::ostream &os, const MInt &a) {return os << a.val();}};constexpr int P = 998244353;using Z = MInt<P>;int main() {std::ios::sync_with_stdio(false);std::cin.tie(nullptr);int n, m;std::cin >> n >> m;std::vector<int> a(n);for (int i = 0; i < n; i++) {std::cin >> a[i];}std::vector<Z> pw(n + 1);pw[0] = 1;for (int i = 1; i <= n; i++) {pw[i] = pw[i - 1] * 2;}std::vector<Z> f(m + 1);for (int i = 0; i < n; i++) {f[a[i]] += 1;}for (int i = 1; i <= m; i++) {for (int j = 2 * i; j <= m; j += i) {f[i] += f[j];}}for (int i = 1; i <= m; i++) {f[i] = pw[f[i].val()] - 1;}for (int i = m; i >= 1; i--) {for (int j = 2 * i; j <= m; j += i) {f[i] -= f[j];}}for (int i = 1; i <= m; i++) {std::cout << f[i] << "\n";}return 0;}