Problem p03467 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define FORall(it, a)                                                          \
  for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define pconent(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed << setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
// const int MOD = (int) 1e9 + 7;
const int MOD = 998244353;
const int FFTMOD = 1007681537;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
const ld PI = acos((ld)-1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {
  ll r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll fpow(ll n, ll k, int p = MOD) {
  ll r = 1;
  for (; k; k >>= 1) {
    if (k & 1)
      r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T> inline int chkmin(T &a, const T &val) {
  return val < a ? a = val, 1 : 0;
}
template <class T> inline int chkmax(T &a, const T &val) {
  return a < val ? a = val, 1 : 0;
}
inline ll isqrt(ll k) {
  ll r = sqrt(k) + 1;
  while (r * r > k)
    r--;
  return r;
}
inline ll icbrt(ll k) {
  ll r = cbrt(k) + 1;
  while (r * r * r > k)
    r--;
  return r;
}
inline void addmod(int &a, int val, int p = MOD) {
  if ((a = (a + val)) >= p)
    a -= p;
}
inline void submod(int &a, int val, int p = MOD) {
  if ((a = (a - val)) < 0)
    a += p;
}
inline int mult(int a, int b, int p = MOD) { return (ll)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(ld x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(ld x, ld y) { return sign(x - y); }
#define db(x) cerr << #x << " = " << (x) << " ";
#define endln cerr << "\n";

const int maxn = 100 + 5;
string s;
int dp[12][1 << 12];
map<string, int> hs;

int calc(int k, int msk) {
  if (!k)
    return 1;
  int &res = dp[k][msk];
  if (~res)
    return res;
  res = 0;
  addmod(res, mult(calc(k - 1, msk >> 1), (msk & 1) + 1));
  FOR(nk, 1, k / 2 + 1) {
    int nmsk = (1 << nk) - 1, nmsk2 = msk;
    FOR(i, 0, k / nk) {
      nmsk &= nmsk2, nmsk2 >>= nk;
      if (i) {
        addmod(res, mult(calc(nk, nmsk), calc(k - nk * (i + 1), nmsk2)));
      }
    }
  }
  return res;
}

int calc(string s) {
  if (sz(s) <= 12) {
    int k = sz(s);
    int msk = 0;
    FOR(i, 0, k) if (s[i] == '1') { msk |= 1 << i; }
    return calc(k, msk);
  }
  if (!sz(s))
    return 1;
  if (hs.count(s))
    return hs[s];
  int &res = hs[s];
  addmod(res, mult(calc(s.substr(1)), s[0] - '0' + 1));
  FOR(i, 1, sz(s) / 2 + 1) {
    string ns = s.substr(0, i);
    for (int j = i; j + i <= sz(s); j += i) {
      FOR(l, 0, i) if (s[j + l] == '0') { ns[l] = '0'; }
      addmod(res, mult(calc(ns), calc(s.substr(j + i, sz(s) - (j + i)))));
    }
  }
  return res;
}

void chemthan() {
  cin >> s;
  ms(dp, -1);
  cout << calc(s) << "\n";
}

int main(int argc, char *argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define FORall(it, a)                                                          \
  for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define pconent(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed << setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
// const int MOD = (int) 1e9 + 7;
const int MOD = 998244353;
const int FFTMOD = 1007681537;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
const ld PI = acos((ld)-1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {
  ll r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll fpow(ll n, ll k, int p = MOD) {
  ll r = 1;
  for (; k; k >>= 1) {
    if (k & 1)
      r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T> inline int chkmin(T &a, const T &val) {
  return val < a ? a = val, 1 : 0;
}
template <class T> inline int chkmax(T &a, const T &val) {
  return a < val ? a = val, 1 : 0;
}
inline ll isqrt(ll k) {
  ll r = sqrt(k) + 1;
  while (r * r > k)
    r--;
  return r;
}
inline ll icbrt(ll k) {
  ll r = cbrt(k) + 1;
  while (r * r * r > k)
    r--;
  return r;
}
inline void addmod(int &a, int val, int p = MOD) {
  if ((a = (a + val)) >= p)
    a -= p;
}
inline void submod(int &a, int val, int p = MOD) {
  if ((a = (a - val)) < 0)
    a += p;
}
inline int mult(int a, int b, int p = MOD) { return (ll)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(ld x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(ld x, ld y) { return sign(x - y); }
#define db(x) cerr << #x << " = " << (x) << " ";
#define endln cerr << "\n";

const int maxn = 100 + 5;
string s;
int dp[13][1 << 12];
map<string, int> hs;

int calc(int k, int msk) {
  if (!k)
    return 1;
  int &res = dp[k][msk];
  if (~res)
    return res;
  res = 0;
  addmod(res, mult(calc(k - 1, msk >> 1), (msk & 1) + 1));
  FOR(nk, 1, k / 2 + 1) {
    int nmsk = (1 << nk) - 1, nmsk2 = msk;
    FOR(i, 0, k / nk) {
      nmsk &= nmsk2, nmsk2 >>= nk;
      if (i) {
        addmod(res, mult(calc(nk, nmsk), calc(k - nk * (i + 1), nmsk2)));
      }
    }
  }
  return res;
}

int calc(string s) {
  if (sz(s) <= 12) {
    int k = sz(s);
    int msk = 0;
    FOR(i, 0, k) if (s[i] == '1') { msk |= 1 << i; }
    return calc(k, msk);
  }
  if (!sz(s))
    return 1;
  if (hs.count(s))
    return hs[s];
  int &res = hs[s];
  addmod(res, mult(calc(s.substr(1)), s[0] - '0' + 1));
  FOR(i, 1, sz(s) / 2 + 1) {
    string ns = s.substr(0, i);
    for (int j = i; j + i <= sz(s); j += i) {
      FOR(l, 0, i) if (s[j + l] == '0') { ns[l] = '0'; }
      addmod(res, mult(calc(ns), calc(s.substr(j + i, sz(s) - (j + i)))));
    }
  }
  return res;
}

void chemthan() {
  cin >> s;
  ms(dp, -1);
  cout << calc(s) << "\n";
}

int main(int argc, char *argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}