Problem p02960 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
typedef unsigned long long int ULL;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#define SET(a, b) memset(a, b, sizeof(a))
#define LET(x, a) __typeof(a) x(a)

#define rep(i, begin, end)                                                     \
  for (__typeof(end) i = (begin) - ((begin) > (end));                          \
       i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
// Works for forward as well as backward iteration

#define gu getchar
#define pu putchar
#define si(n) scanf("%d", &n)
#define dout(n) printf("%d\n", n)
#define sll(n) scanf("%lld", &n)
#define lldout(n) printf("%lld\n", n)

#define DRT()                                                                  \
  int t;                                                                       \
  si(t);                                                                       \
  while (t--)

#define PlUSWRAP(index, n)                                                     \
  index = (index + 1) % n // index++; if(index>=n) index=0
#define MINUSWRAP(index, n)                                                    \
  index = (index + n - 1) % n // index--; if(index<0) index=n-1
#define ROUNDOFFINT(d)                                                         \
  d = (int)((double)d + 0.5) // Round off d to nearest integer

#define FLUSHN while (gu() != '\n')
#define FLUSHS while (gu() != ' ')

#define TRACE

#ifdef TRACE
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y)                                                           \
  cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z)                                                        \
  cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": "   \
       << z << endl;
#define trace4(a, b, c, d)                                                     \
  cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": "   \
       << c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e)                                                  \
  cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": "   \
       << c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f)                                               \
  cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": "   \
       << c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | "   \
       << #f << ": " << f << endl;

#else

#define trace1(x)
#define trace2(x, y)
#define trace3(x, y, z)
#define trace4(a, b, c, d)
#define trace5(a, b, c, d, e)
#define trace6(a, b, c, d, e, f)

#endif

#define off                                                                    \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);                                                                  \
  cout.tie(0)
LL mod = (LL)1e9 + 7;
LL n;
string s;
LL mod_mlt(LL x, LL y, LL mod) {
  LL ret = 0LL;
  x %= mod;

  while (y) {
    if (y & 1LL) {
      ret += x;
      ret %= mod;
    }
    y >>= 1;
    x <<= 1;
    x %= mod;
  }

  return ret;
}

LL mod_pow(LL base, LL exp, LL mod) {
  LL ret = 1LL;

  for (; exp;) {
    if (exp & 1LL) {
      ret *= base;
      ret %= mod;
    }
    base = (base * base) % mod;
    exp >>= 1;
  }

  return ret;
}

LL mod_inv(LL x, LL mod) {
  // available only when mod is prime
  return mod_pow(x, mod - 2LL, mod);
}
vector<vector<LL>> dp;
int main() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
  off;
  cin >> s;
  n = s.length();
  dp.resize(n + 1, vector<LL>(13, 0));
  if (s[0] == '?') {
    rep(i, 0, 10) dp[0][i] = 1;
  } else
    dp[0][s[0] - '0'] = 1;
  rep(i, 1, n) {
    if (s[i] != '?') {
      rep(j, 0, 13) {
        rep(k, 0, 13) {
          if ((k * 10 + (s[i] - '0')) % 13 == j)
            dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mod;
        }
      }
    } else {
      rep(j, 0, 13) {
        rep(k, 0, 13) {
          rep(l, 0, 10) {
            if ((k * 10 + l) % 13 == j)
              dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mod;
          }
        }
      }
    }
  }
  cout << dp[n - 1][5];
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
typedef unsigned long long int ULL;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#define SET(a, b) memset(a, b, sizeof(a))
#define LET(x, a) __typeof(a) x(a)

#define rep(i, begin, end)                                                     \
  for (__typeof(end) i = (begin) - ((begin) > (end));                          \
       i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
// Works for forward as well as backward iteration

#define gu getchar
#define pu putchar
#define si(n) scanf("%d", &n)
#define dout(n) printf("%d\n", n)
#define sll(n) scanf("%lld", &n)
#define lldout(n) printf("%lld\n", n)

#define DRT()                                                                  \
  int t;                                                                       \
  si(t);                                                                       \
  while (t--)

#define PlUSWRAP(index, n)                                                     \
  index = (index + 1) % n // index++; if(index>=n) index=0
#define MINUSWRAP(index, n)                                                    \
  index = (index + n - 1) % n // index--; if(index<0) index=n-1
#define ROUNDOFFINT(d)                                                         \
  d = (int)((double)d + 0.5) // Round off d to nearest integer

#define FLUSHN while (gu() != '\n')
#define FLUSHS while (gu() != ' ')

#define TRACE

#ifdef TRACE
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y)                                                           \
  cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z)                                                        \
  cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": "   \
       << z << endl;
#define trace4(a, b, c, d)                                                     \
  cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": "   \
       << c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e)                                                  \
  cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": "   \
       << c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f)                                               \
  cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": "   \
       << c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | "   \
       << #f << ": " << f << endl;

#else

#define trace1(x)
#define trace2(x, y)
#define trace3(x, y, z)
#define trace4(a, b, c, d)
#define trace5(a, b, c, d, e)
#define trace6(a, b, c, d, e, f)

#endif

#define off                                                                    \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);                                                                  \
  cout.tie(0)
LL mod = (LL)1e9 + 7;
LL n;
string s;
LL mod_mlt(LL x, LL y, LL mod) {
  LL ret = 0LL;
  x %= mod;

  while (y) {
    if (y & 1LL) {
      ret += x;
      ret %= mod;
    }
    y >>= 1;
    x <<= 1;
    x %= mod;
  }

  return ret;
}

LL mod_pow(LL base, LL exp, LL mod) {
  LL ret = 1LL;

  for (; exp;) {
    if (exp & 1LL) {
      ret *= base;
      ret %= mod;
    }
    base = (base * base) % mod;
    exp >>= 1;
  }

  return ret;
}

LL mod_inv(LL x, LL mod) {
  // available only when mod is prime
  return mod_pow(x, mod - 2LL, mod);
}
vector<vector<LL>> dp;
int main() {
  // #ifndef ONLINE_JUDGE
  //    freopen("input.txt", "r", stdin);
  //    freopen("output.txt", "w", stdout);
  // #endif
  off;
  cin >> s;
  n = s.length();
  dp.resize(n + 1, vector<LL>(13, 0));
  if (s[0] == '?') {
    rep(i, 0, 10) dp[0][i] = 1;
  } else
    dp[0][s[0] - '0'] = 1;
  rep(i, 1, n) {
    if (s[i] != '?') {
      rep(j, 0, 13) {
        rep(k, 0, 13) {
          if ((k * 10 + (s[i] - '0')) % 13 == j)
            dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mod;
        }
      }
    } else {
      rep(j, 0, 13) {
        rep(k, 0, 13) {
          rep(l, 0, 10) {
            if ((k * 10 + l) % 13 == j)
              dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mod;
          }
        }
      }
    }
  }
  cout << dp[n - 1][5];
  return 0;
}