fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1e9+7;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27. // 3
  28. // 3 14 15
  29.  
  30.  
  31.  
  32. const int MOD = 998244353;
  33.  
  34. vector<int> a;
  35.  
  36. int consistency(int n){
  37.  
  38. vector<int> prefix(n+1);
  39. for(int i=0; i<n; i++){
  40. prefix[i+1] = (prefix[i] + a[i])%MOD;
  41. }
  42.  
  43. int ans = 0;
  44. for(int i=n-1; i>=0; i--){
  45.  
  46. int x = a[i];
  47. int psum = prefix[i];
  48.  
  49. //* psum = psum * 10^digits
  50. while(x>0){
  51. psum = (psum * 10)%MOD;
  52. x /= 10;
  53. }
  54.  
  55. psum = (psum + (i*a[i])%MOD )%MOD;
  56.  
  57. ans = (ans + psum)%MOD;
  58. }
  59.  
  60. return ans;
  61. }
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77. int practice(int n){
  78.  
  79.  
  80. return 0;
  81. }
  82.  
  83.  
  84.  
  85.  
  86.  
  87. void solve() {
  88.  
  89. int n;
  90. cin>> n;
  91.  
  92. a.resize(n);
  93. for(int i=0; i<n; i++) cin >> a[i];
  94.  
  95. cout << consistency(n) << endl;
  96.  
  97.  
  98. }
  99.  
  100.  
  101.  
  102.  
  103.  
  104. int32_t main() {
  105. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  106.  
  107. int t = 1;
  108. // cin >> t;
  109. while (t--) {
  110. solve();
  111. }
  112.  
  113. return 0;
  114. }
Success #stdin #stdout 0s 5300KB
stdin
3
3 14 15
stdout
2044