Submission #6616625

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;

using namespace std;

const ll M = 1000000007;

ll dp[100100][13]; // dp[i][j]: i桁目まで見た時に、あまりがjとなる場合の数

signed main() {
  rep(i,0,100100) rep(j,0,13) dp[i][j]=0;
  string s;
  cin>>s;
  ll N = s.size();
  reverse(begin(s),end(s));
  dp[0][0] = 1;
  for (ll i=1, ten=1; i<=N; i++,(ten*=10)%=13) {
    if (s[i-1] == '?') {
      rep(x,0,10) {
        ll m = (x*ten) % 13;
        rep(j,0,13){
          (dp[i][(j+m) % 13] += dp[i-1][j]) %= M;
        }
      }
    } else {
      ll x = s[i-1] - '0';
      ll m = (x*ten) % 13;
      rep(j,0,13){
        (dp[i][(j+m) % 13] += dp[i-1][j]) %= M;
      }
    }
  }
  cout<<dp[N][5]<<endl;
  return 0;
}

Submission Info

Judge Result