#973884 (C++17) No.2729 Addition and Multiplication in yukicoder (Easy)

• 問題: No.2729 Addition and Multiplication in yukicoder (Easy)
• ユーザー: Aging1986
• 提出日時: 2024-04-19 21:41:42
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 54 ms / 2,000 ms
• コード長: 2,245 bytes
• コンパイル時間: 3,135 ms
• コンパイル使用メモリ: 224,444 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-11 14:30:22
• 合計ジャッジ時間: 4,536 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	41 ms; 5,248 KB
testcase_03	AC	37 ms; 5,248 KB
testcase_04	AC	38 ms; 5,248 KB
testcase_05	AC	40 ms; 5,248 KB
testcase_06	AC	53 ms; 5,248 KB
testcase_07	AC	43 ms; 5,248 KB
testcase_08	AC	43 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	54 ms; 5,248 KB
testcase_13	AC	53 ms; 5,248 KB
testcase_14	AC	53 ms; 5,248 KB
testcase_15	AC	53 ms; 5,248 KB
testcase_16	AC	37 ms; 5,248 KB
testcase_17	AC	36 ms; 5,248 KB
testcase_18	AC	45 ms; 5,248 KB
testcase_19	AC	36 ms; 5,248 KB

ソースコード

#pragma clang diagnostic push
#pragma ide diagnostic ignored "cppcoreguidelines-narrowing-conversions"
#pragma ide diagnostic ignored "hicpp-signed-bitwise"
#pragma GCC optimize ("Ofast,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<pdd> vpdd;
typedef vector<vd> vvd;
#define yn(ans) printf("%s\n", (ans)?"Yes":"No");
#define YN(ans) printf("%s\n", (ans)?"YES":"NO");
template<class T> bool chmax(T &a, T b) {
	if (a >= b) return false;
	a = b; return true;
}
template<class T> bool chmin(T &a, T b) {
	if (a <= b) return false;
	a = b; return true;
}
#define FOR(i, s, e, t) for ((i) = (s); (i) < (e); (i) += (t)) 
#define REP(i, e) for (int i = 0; i < (e); ++i) 
#define REP1(i, s, e) for (int i = (s); i < (e); ++i)
#define RREP(i, e) for (int i = (e); i >= 0; --i)
#define RREP1(i, e, s) for (int i = (e); i >= (s); --i)
#define all(v) v.begin(), v.end()
#define pb push_back
#define qb pop_back
#define pf push_front
#define qf pop_front
#define maxe max_element
#define mine min_element
ll inf = 1e18;
#define DEBUG printf("%d\n", __LINE__); fflush(stdout);
template<class T> void print(vector<T> &v, bool withSize = false) {
	if (withSize) cout << v.size() << endl;
	REP(i, v.size()) cout << v[i] << " "; 
	cout << endl;
}
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());

int __FAST_IO__ = []() {
	std::ios::sync_with_stdio(0);
	std::cin.tie(0);
	std::cout.tie(0);
	return 0;
}();

#define TESTS int t; cin >> t; while (t--)
#define TEST 
int main() {
    TEST {
    	int N;
    	cin >> N;
    	vll v(N);
    	REP(i, N) cin >> v[i];
    	sort(all(v));
    	ll ans = 0, MOD = 998244353;
    	REP(i, N) ans = (ans * 10 + v[i] % MOD) % MOD;
    	printf("%lld\n", ans);
    }
    
    return 0;
}