Problem p00460 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>

#define int long long int
#define rep(a, b, c) for (int a = b; a < c; a++)
#define repm(a, b, c) for (int a = (b - 1); a >= c; a--)
#define pb push_back
#define str string
#define sf(a) scanfs("%d", &a)
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) (v).begin(), (v).end()

using namespace std;

const int INF = 1e18 + 9;
const int Mod = 1e9 + 7;
inline int replac(str s) {
  double ans = 0;
  rep(i, 0, s.length()) { ans += (s[i] - '0') * pow(10, s.length() - i - 1); }
  return (int)ans;
}
inline string numstr(int m) {
  str s = "";
  while (m > 0) {
    char c;
    int a = m / 10;
    if (a > 0)
      a = m % (a * 10);
    else
      a = m;
    c = (char)('0' + a);
    s += c;
    m /= 10;
  }
  str st = "";
  for (int i = s.size() - 1; i >= 0; i--) {
    st += s[i];
  }
  return st;
}
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
int dp[50][3003];
///?£????????£???????????§???????????????????£??????§???????????£???(???????°????????????¨???????¶?...)(?????????????????§???.)
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, m, s;
  int mod = 100000;
  while (1) {
    cin >> n >> m >> s;
    if (n == 0 && m == 0 && s == 0)
      break;
    rep(i, 0, 50) {
      rep(j, 0, 3003) { dp[i][j] = 0; }
    }
    dp[0][0] = 1;
    rep(i, 1, m + 1) {
      for (int j = n * n; j > 0; j--) {
        rep(k, i, s + 1) { (dp[j][k] += dp[j - 1][k - i]) %= mod; }
      }
    }
    cout << dp[n * n][s] % mod << endl;
  }
  return 0;
}

Error: -11

Fixed submission:

#include <bits/stdc++.h>

#define int long long int
#define rep(a, b, c) for (int a = b; a < c; a++)
#define repm(a, b, c) for (int a = (b - 1); a >= c; a--)
#define pb push_back
#define str string
#define sf(a) scanfs("%d", &a)
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) (v).begin(), (v).end()

using namespace std;

const int INF = 1e18 + 9;
const int Mod = 1e9 + 7;
inline int replac(str s) {
  double ans = 0;
  rep(i, 0, s.length()) { ans += (s[i] - '0') * pow(10, s.length() - i - 1); }
  return (int)ans;
}
inline string numstr(int m) {
  str s = "";
  while (m > 0) {
    char c;
    int a = m / 10;
    if (a > 0)
      a = m % (a * 10);
    else
      a = m;
    c = (char)('0' + a);
    s += c;
    m /= 10;
  }
  str st = "";
  for (int i = s.size() - 1; i >= 0; i--) {
    st += s[i];
  }
  return st;
}
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
int dp[50][3003];
///?£????????£???????????§???????????????????£??????§???????????£???(???????°????????????¨???????¶?...)(?????????????????§???.)
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, m, s;
  int mod = 100000;
  while (1) {
    cin >> n >> m >> s;
    if (n == 0 && m == 0 && s == 0)
      break;
    rep(i, 0, 50) {
      rep(j, 0, 3003) { dp[i][j] = 0; }
    }
    dp[0][0] = 1;
    rep(i, 1, m + 1) {
      for (int j = n * n; j >= 0; j--) {
        rep(k, i, s + 1) { (dp[j][k] += dp[j - 1][k - i]) %= mod; }
      }
    }
    cout << dp[n * n][s] % mod << endl;
  }
  return 0;
}