Submission #225256

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (1000000007)
int N;
ll A[155];
ll R[155];
ll solve(){
  int st = 0;
  ll res = 1;
  for(int i=0;i<100;i++){
    R[i] += A[i];
    if( R[i]/10 == 0 ) {
      ll sum = 0;
      ll k = 1;
      for(int j=st;j<=i;j++){  
	sum += A[j]*k;
	k*=10; k%=MOD;
      }
      sum++;
      res *= sum%MOD;
      res %=MOD;
      st=i+1;
    }
    R[i+1] = R[i]/10;
  }
  return res;
}

int main() {
  cin >> N;
  for(int i=0;i<N;i++) cin >> A[i];
  cout << (solve() +MOD - 1LL)%MOD << endl;
}

Submission Info

Judge Result