Problem p04041 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
long long X, Y, Z, n, power[50], mod = 1000000007;
int M[42][262144], GO[262144][10];

string parse(int r, int bit) {
  int cnt = 1, c = -1;
  string Y = "";
  for (int i = 0; i < r; i++) {
    if ((bit & (1 << i)) != 0)
      c = i;
  }
  r = c + 1;
  for (int i = 0; i < r; i++) {
    if ((bit & (1 << i)) != 0) {
      Y += ('0' + cnt);
      cnt = 1;
    } else
      cnt++;
  }
  return Y;
}
int parse2(int r, string Y) {
  int cnt = 0, t = 0;
  for (int i = 0; i < Y.size(); i++) {
    t += (Y[i] - '0');
    cnt += (1 << (t - 1));
  }
  return cnt;
}
long long solve(int depth, int bit) {
  if (M[depth][bit] >= 0)
    return M[depth][bit];
  string S = parse(X + Y + Z, bit);

  int G = 0, R = 0;
  for (int i = S.size() - 1; i >= 0; i--) {
    G += (S[i] - '0');
    if (G == X || G == X + Y || G == X + Y + Z)
      R++;
  }
  if (R == 3) {
    M[depth][bit] = power[n - depth];
    return power[n - depth];
  }
  if (depth == n) {
    M[depth][bit] = 0;
    return 0;
  }

  long long cnt = 0;
  for (int i = 1; i <= 10; i++) {
    int P = GO[bit][i];
    cnt += solve(depth + 1, P);
    cnt %= mod;
  }
  M[depth][bit] = cnt;
  return cnt;
}
int main() {
  cin >> n >> X >> Y >> Z;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j < (1 << (X + Y + Z)); j++) {
      M[i][j] = -1;
    }
  }
  for (int i = 0; i < (1 << (X + Y + Z)); i++) {
    for (int j = 1; j <= 10; j++) {
      string A = parse(X + Y + Z, i);
      A += ('0' + j);
      int V = 0, C = 0;
      for (int k = 0; k < A.size(); k++)
        V += (A[k] - '0');
      if (j >= 8) {
        V = 0;
        A = "";
      }
      while (V > X + Y + Z) {
        V -= (A[C] - '0');
        C++;
      }
      A = A.substr(C, A.size() - C);
      GO[i][j] = parse2(X + Y + Z, A);
    }
  }
  power[0] = 1;
  for (int i = 1; i < 50; i++)
    power[i] = power[i - 1] * 10 % mod;
  cout << solve(0, 0) << endl;
  return 0;
}

Fixed submission:
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
long long X, Y, Z, n, power[50], mod = 1000000007;
int M[42][262144], GO[262144][11];

string parse(int r, int bit) {
  int cnt = 1, c = -1;
  string Y = "";
  for (int i = 0; i < r; i++) {
    if ((bit & (1 << i)) != 0)
      c = i;
  }
  r = c + 1;
  for (int i = 0; i < r; i++) {
    if ((bit & (1 << i)) != 0) {
      Y += ('0' + cnt);
      cnt = 1;
    } else
      cnt++;
  }
  return Y;
}
int parse2(int r, string Y) {
  int cnt = 0, t = 0;
  for (int i = 0; i < Y.size(); i++) {
    t += (Y[i] - '0');
    cnt += (1 << (t - 1));
  }
  return cnt;
}
long long solve(int depth, int bit) {
  if (M[depth][bit] >= 0)
    return M[depth][bit];
  string S = parse(X + Y + Z, bit);

  int G = 0, R = 0;
  for (int i = S.size() - 1; i >= 0; i--) {
    G += (S[i] - '0');
    if (G == X || G == X + Y || G == X + Y + Z)
      R++;
  }
  if (R == 3) {
    M[depth][bit] = power[n - depth];
    return power[n - depth];
  }
  if (depth == n) {
    M[depth][bit] = 0;
    return 0;
  }

  long long cnt = 0;
  for (int i = 1; i <= 10; i++) {
    int P = GO[bit][i];
    cnt += solve(depth + 1, P);
    cnt %= mod;
  }
  M[depth][bit] = cnt;
  return cnt;
}
int main() {
  cin >> n >> X >> Y >> Z;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j < (1 << (X + Y + Z)); j++) {
      M[i][j] = -1;
    }
  }
  for (int i = 0; i < (1 << (X + Y + Z)); i++) {
    for (int j = 1; j <= 10; j++) {
      string A = parse(X + Y + Z, i);
      A += ('0' + j);
      int V = 0, C = 0;
      for (int k = 0; k < A.size(); k++)
        V += (A[k] - '0');
      if (j >= 8) {
        V = 0;
        A = "";
      }
      while (V > X + Y + Z) {
        V -= (A[C] - '0');
        C++;
      }
      A = A.substr(C, A.size() - C);
      GO[i][j] = parse2(X + Y + Z, A);
    }
  }
  power[0] = 1;
  for (int i = 1; i < 50; i++)
    power[i] = power[i - 1] * 10 % mod;
  cout << solve(0, 0) << endl;
  return 0;
}