Problem p03467 (C++)

Buggy submission (status: Runtime Error):
/*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c)                                                         \
  (sort(c.begin(), c.end()),                                                   \
   c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET                                                                  \
  int ___T;                                                                    \
  scanf("%d", &___T);                                                          \
  for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef int64_t LL;
typedef uint64_t ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
  _W(x.F);
  putchar(' ');
  _W(x.S);
}
template <class T> void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin())
      putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
}
template <class T, class... U> void DEBUG(const T &head, const U &...tail) {
#ifdef HOME
  _W('#');
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
#endif
}
int MOD = 998244353;
void ADD(LL &x, LL v) {
  x = (x + v) % MOD;
  if (x < 0)
    x += MOD;
}
/*}}}*/
const int SIZE = 104;
map<string, LL> dp[SIZE];
map<string, LL> dp0[SIZE];
LL solve(string s);
LL get(string s) {
  int n = SZ(s);
  if (dp[n].count(s))
    return dp[n][s];
  LL &res = dp[n][s];
  REPP(i, 1, n) {
    if (n % i == 0) {
      string nxt = string(i, '1');
      REP(j, n)
      if (s[j] == '0')
        nxt[j % i] = '0';
      ADD(res, solve(nxt));
    }
  }
  return res;
}
LL solve(string s) {
  int n = SZ(s);
  if (dp0[n].count(s))
    return dp0[n][s];
  LL dp2[SIZE];
  dp2[0] = 1;
  FOR(i, 1, n) {
    dp2[i] = dp2[i - 1] * (s[i - 1] - '0' + 1);
    REP(j, i - 1) { ADD(dp2[i], dp2[j] * get(s.substr(j, i - j))); }
  }
  return dp0[n][s] = dp2[n];
}
int main() {
  string s;
  dp0[1]["0"] = 1;
  dp0[1]["1"] = 2;
  R(s);
  REP(i, 100) s[i] = rand() % 2 + '0';
  W(solve(s));
  return 0;
}


Fixed submission:
/*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c)                                                         \
  (sort(c.begin(), c.end()),                                                   \
   c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET                                                                  \
  int ___T;                                                                    \
  scanf("%d", &___T);                                                          \
  for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef int64_t LL;
typedef uint64_t ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
  _W(x.F);
  putchar(' ');
  _W(x.S);
}
template <class T> void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin())
      putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
}
template <class T, class... U> void DEBUG(const T &head, const U &...tail) {
#ifdef HOME
  _W('#');
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
#endif
}
int MOD = 998244353;
void ADD(LL &x, LL v) {
  x = (x + v) % MOD;
  if (x < 0)
    x += MOD;
}
/*}}}*/
const int SIZE = 104;
map<string, LL> dp[SIZE];
map<string, LL> dp0[SIZE];
LL solve(string s);
LL get(string s) {
  int n = SZ(s);
  if (dp[n].count(s))
    return dp[n][s];
  LL &res = dp[n][s];
  REPP(i, 1, n) {
    if (n % i == 0) {
      string nxt = string(i, '1');
      REP(j, n)
      if (s[j] == '0')
        nxt[j % i] = '0';
      ADD(res, solve(nxt));
    }
  }
  return res;
}
LL solve(string s) {
  int n = SZ(s);
  if (dp0[n].count(s))
    return dp0[n][s];
  LL dp2[SIZE];
  dp2[0] = 1;
  FOR(i, 1, n) {
    dp2[i] = dp2[i - 1] * (s[i - 1] - '0' + 1);
    REP(j, i - 1) { ADD(dp2[i], dp2[j] * get(s.substr(j, i - j))); }
  }
  return dp0[n][s] = dp2[n];
}
int main() {
  string s;
  dp0[1]["0"] = 1;
  dp0[1]["1"] = 2;
  R(s);
  W(solve(s));
  return 0;
}