結果
問題 |
No.2734 Addition and Multiplication in yukicoder (Hard)
|
ユーザー |
|
提出日時 | 2024-04-19 21:43:43 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,854 bytes |
コンパイル時間 | 2,303 ms |
コンパイル使用メモリ | 203,480 KB |
最終ジャッジ日時 | 2025-02-21 04:01:28 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 1 WA * 35 |
ソースコード
#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> A(N); for(auto &a : A) cin >> a; sort(A.begin(),A.end()); mint answer = 0; for(string s : A){ for(char c : s){ answer *= 10; answer += c-'0'; } } cout << answer.v << endl; }