結果
問題 | No.2264 Gear Coloring |
ユーザー |
👑 ![]() |
提出日時 | 2023-04-07 21:46:26 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 115 ms / 2,000 ms |
コード長 | 2,752 bytes |
コンパイル時間 | 2,476 ms |
コンパイル使用メモリ | 201,800 KB |
最終ジャッジ日時 | 2025-02-12 01:01:37 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (ll i=a;i<b;i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}//Nの正の約数を列挙するvector<long long> Divisors(long long N){vector<long long> p,q;long long i=1,K=0;while(i*i<N){if(N%i==0){p.push_back(i);q.push_back(N/i);K++;}i++;}if(i*i==N) p.push_back(i);for(int i=K-1;i>=0;i--){p.push_back(q[i]);}return p;}ll jyo(ll x,ll y,ll z){ll H=y; //ここからll a=1,b=(x%z+z)%z,c=1;while(H>0){a*=2;if(H%a!=0){H-=a/2;c*=b;c%=z;}b*=b;b%=z;} //ここまでreturn c;}void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,0,t) solve();}void solve(){ll N,M;cin>>N>>M;ll B=1;vector<ll> A(N);rep(i,0,N){cin>>A[i];ll c=__gcd(A[i],B);B/=c;B*=A[i];}auto div=Divisors(B);ll L=div.size();vector<ll> X(L);ll ans=0;for(int i=L-1;i>=0;i--){X[i]=B/div[i];rep(j,i+1,L){if(div[j]%div[i]==0) X[i]-=X[j];}ll tmp=0;rep(j,0,N){tmp+=__gcd(div[i],A[j]);}//cout<<div[i]<<" "<<X[i]<<" "<<tmp<<endl;ans=(ans+X[i]*jyo(M,tmp,mod))%mod;}ans=(ans*jyo(B,mod-2,mod))%mod;cout<<(ans+mod)%mod<<"\n";}