結果
問題 | No.2487 Multiple of M |
ユーザー |
👑 ![]() |
提出日時 | 2023-09-29 21:25:30 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,842 bytes |
コンパイル時間 | 2,327 ms |
コンパイル使用メモリ | 210,200 KB |
最終ジャッジ日時 | 2025-02-17 03:06:01 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 53 |
ソースコード
#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;const ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (int i=(int)(a);i<(int)(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,int ty=0){if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}else{if(ty==1){cout<<p.size()<<"\n";}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;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}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;}template<class T>using square_matrix=std::vector<std::vector<T>>;template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>square_matrix<T> mul_matrix(square_matrix<T> l,square_matrix<T> r){int n=l.size();assert((int)l[0].size()==n&&(int)r.size()==n&&(int)r[0].size()==n);square_matrix<T> val(n,std::vector<T>(n,add_e()));for(int i=0;i<n;i++) for(int j=0;j<n;j++) for(int k=0;k<n;k++){val[i][k]=add_op(val[i][k],mul_op(l[i][j],r[j][k]));}return val;}template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>square_matrix<T> pow_matrix(square_matrix<T> l,long long times){int n=l.size();square_matrix<T> val(n,std::vector<T>(n,add_e()));for(int i=0;i<n;i++) val[i][i]=mul_e();while(times){if(times&1){val=mul_matrix<T,add_op,add_e,mul_op,mul_e>(val,l);}l=mul_matrix<T,add_op,add_e,mul_op,mul_e>(l,l);times>>=1;}return val;}using mat_F=ll;mat_F add_op(mat_F a,mat_F b){return (a+b)%mod;}mat_F add_e(){return 0;}mat_F mul_op(mat_F a,mat_F b){return (a*b)%mod;}mat_F mul_e(){return 1;}#define calc mat_F,add_op,add_e,mul_op,mul_evoid 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,K;cin>>N>>M>>K;ll B=1;ll X=1,Y=0;ll rp=min(40ll,N);rep(i,0,rp){ll n_X=X*(B-1)+Y*B;ll n_Y=(X+Y)*(M-1)-n_X;X=n_X%mod;Y=n_Y%mod;ll n_B=gcd(B*K,M);Y=Y*(M/n_B-1)%mod;Y=Y*(jyo(M/B-1,mod-2,mod))%mod;B=n_B;}if(rp==N){cout<<(X%mod+mod)%mod<<"\n";return;}vector<vector<ll>> p={{B-1,M-B},{B,M-B-1}};p=pow_matrix<calc>(p,N-rp);ll ans=X*p[0][0]+Y*p[1][0];cout<<(ans%mod+mod)%mod<<"\n";}