結果

問題 No.2734 Addition and Multiplication in yukicoder (Hard)
ユーザー GOTKAKO
提出日時 2024-04-19 21:52:39
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 715 ms / 5,000 ms
コード長 1,915 bytes
コンパイル時間 2,270 ms
コンパイル使用メモリ 203,512 KB
最終ジャッジ日時 2025-02-21 04:10:25
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
//mod使.
struct mint{
long long v = 0;
mint(){} mint(int a){v = a;} mint(long long a){v = a;} mint(unsigned long long a){v = a;}
long long val(){return v;}
void modu(){v %= mod;}
mint repeat2mint(long long a,long long b){
mint ret = 1,p = a;
while(b){if(b&1) ret *= p; p *= p; b >>= 1;}
return ret;
};
mint operator-(){return mint(0)-mint(v);}
mint operator+(mint b){return (v+b.v)%mod;}
mint operator-(mint b){return (v-b.v+mod)%mod;}
mint operator*(mint b){return v*b.v%mod;}
mint operator/(mint b){
if(b.v == 0) assert(false);
return v*(repeat2mint(b.v,mod-2)).v%mod;
}
void operator+=(mint b){v = (v+b.v)%mod;}
void operator-=(mint b){v = (v-b.v+mod)%mod;}
void operator*=(mint b){v = v*b.v%mod;}
void operator/=(mint b){
if(b.v == 0) assert(false);
v = v*repeat2mint(b.v,mod-2).v%mod;
}
void operator++(int){v = (v+1)%mod; return;}
void operator--(int){v = (v-1+mod)%mod; return;}
bool operator==(mint b){return v == b.v;}
bool operator!=(mint b){return v != b.v;}
bool operator>(mint b) {return v > b.v;}
bool operator>=(mint b){return v >= b.v;}
bool operator<(mint b) {return v < b.v;}
bool operator<=(mint b){return v <= b.v;}
mint pow(long long x){return repeat2mint(v,x);}
mint inv(){return mint(1)/v;}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N; cin >> N;
vector<string> S(N);
for(auto &s : S) cin >> s;
auto f = [](string &s,string &t) -> bool {
string st = s+t,ts = t+s;
return st < ts;
};
sort(S.begin(),S.end(),f);
mint answer = 0;
for(auto s : S) for(auto c : s) answer = answer*10+c-'0';
cout << answer.v << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0