結果
問題 | No.2211 Frequency Table of GCD |
ユーザー |
|
提出日時 | 2023-02-10 21:48:53 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 98 ms / 2,000 ms |
コード長 | 2,685 bytes |
コンパイル時間 | 2,056 ms |
コンパイル使用メモリ | 196,588 KB |
最終ジャッジ日時 | 2025-02-10 12:35:04 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include "bits/stdc++.h"using namespace std;#define all(x) begin(x),end(x)template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream&operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }#define debug(a) cerr << "(" << #a << ": " << a << ")\n";typedef long long ll;typedef vector<int> vi;typedef vector<vi> vvi;typedef pair<int,int> pi;const int mxN = 1e5+1, oo = 1e9;const long long MD = 998244353;template<long long MOD=MD> struct mdint {int d=0;mdint () {d=0;}mdint (long long _d) : d(_d%MOD){if(d<0) d+=MOD;};friend mdint& operator+=(mdint& a, const mdint& o) {a.d+=o.d; if(a.d>=MOD) a.d-=MOD;return a;}friend mdint& operator-=(mdint& a, const mdint& o) {a.d-=o.d; if(a.d<0) a.d+=MOD;return a;}friend mdint& operator*=(mdint& a, const mdint& o) {return a = mdint((ll)a.d*o.d);}mdint operator*(const mdint& o) const {mdint res = *this;res*=o;return res;}mdint operator+(const mdint& o) const {mdint res = *this;res+=o;return res;}mdint operator-(const mdint& o) const {mdint res = *this;res-=o;return res;}mdint operator^(long long b) const {mdint tmp = 1;mdint power = *this;while(b) {if(b&1) {tmp = tmp*power;}power = power*power;b/=2;}return tmp;}friend mdint operator/=(mdint& a, const mdint& o) {a *= (o^(MOD-2));return a;}mdint operator/(const mdint& o) {mdint res = *this;res/=o;return res;}bool operator==(const mdint& o) { return d==o.d;}bool operator!=(const mdint& o) { return d!=o.d;}friend istream& operator>>(istream& c, mdint& a) {return c >> a.d;}friend ostream& operator<<(ostream& c, const mdint& a) {return c << a.d;}};using mint = mdint<MD>;int main() {int n,m; cin >> n >> m;vi a(n);vi cnt(m+1);for(auto& i : a) cin >> i,cnt[i]++;vector<mint> res(m+1);for(int k=m;k>=1;--k) {int num=0;for(int j=k;j<=m;j+=k) {num+=cnt[j];res[k]-=res[j];}res[k]+=(mint(2)^num) -1;}for(int i=1;i<=m;++i) cout << res[i] << '\n';}