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.  
  28. const int MOD = 998244353;
  29.  
  30. vector<int> a;
  31.  
  32. int consistency(int n){
  33.  
  34. vector<int> prefix(n+1);
  35. for(int i=0; i<n; i++){
  36. prefix[i+1] = (prefix[i] + a[i])%MOD;
  37. }
  38.  
  39. int ans = 0;
  40. for(int i=n-1; i>=0; i--){
  41.  
  42. int x = a[i];
  43. int sum = prefix[i];
  44.  
  45. while(x>0){
  46. sum = (sum * 10)%MOD;
  47. x /= 10;
  48. }
  49.  
  50. sum = (sum + (i*a[i])%MOD )%MOD;
  51.  
  52. ans = (ans + sum)%MOD;
  53. }
  54.  
  55. return ans;
  56. }
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72. int practice(int n){
  73.  
  74.  
  75. return 0;
  76. }
  77.  
  78.  
  79.  
  80.  
  81.  
  82. void solve() {
  83.  
  84. int n;
  85. cin>> n;
  86.  
  87. a.resize(n);
  88. for(int i=0; i<n; i++) cin >> a[i];
  89.  
  90. cout << consistency(n) << endl;
  91.  
  92.  
  93. }
  94.  
  95.  
  96.  
  97.  
  98.  
  99. int32_t main() {
  100. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  101.  
  102. int t = 1;
  103. // cin >> t;
  104. while (t--) {
  105. solve();
  106. }
  107.  
  108. return 0;
  109. }
Success #stdin #stdout 0.01s 5252KB
stdin
3
3 14 15
stdout
2044