Problem p03230 (C++)

Buggy submission (status: Runtime Error):
/*
    Author:zeke

    pass System Test!
    GET AC!!
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s)                                                                \
  ll(s);                                                                       \
  cin >> (s);
#define Scin(s)                                                                \
  ll(s);                                                                       \
  cin >> (s);
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll MOD = 1e9 + 7;
ll INF = 1e18;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n;
  cin >> n;
  ll m = n * 2;
  bool h = false;
  ll res;
  rep3(i, 1, sqrt(m)) {
    if (m % i == 0) {
      if (abs(m / i - i) == 1) {
        h = true;
        res = i;
        break;
      }
    }
  }
  if (!h) {
    cout << "No" << endl;
    return 0;
  }
  cout << "Yes" << endl;
  ll temp = 0;
  VV Res(n + 1, V(n));
  cout << res + 1 << endl;
  rep(i, res + 1) {
    rep(j, res) {
      if (i - (j + 1) >= 0) {
        Res[i][j] = Res[i - (j + 1)][i - 1];
      } else {
        temp++;
        Res[i][j] = temp;
      }
    }
  }
  rep(i, res + 1) {
    cout << res << " ";
    rep(j, res) { cout << Res[i][j] << " "; }
    cout << endl;
  }
}

Fixed submission:
/*
    Author:zeke

    pass System Test!
    GET AC!!
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s)                                                                \
  ll(s);                                                                       \
  cin >> (s);
#define Scin(s)                                                                \
  ll(s);                                                                       \
  cin >> (s);
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll MOD = 1e9 + 7;
ll INF = 1e18;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n;
  cin >> n;
  ll m = n * 2;
  bool h = false;
  ll res;
  rep3(i, 1, sqrt(m)) {
    if (m % i == 0) {
      if (abs(m / i - i) == 1) {
        h = true;
        res = i;
        break;
      }
    }
  }
  if (!h) {
    cout << "No" << endl;
    return 0;
  }
  cout << "Yes" << endl;
  ll temp = 0;
  VV Res(res + 1, V(res));
  cout << res + 1 << endl;
  rep(i, res + 1) {
    rep(j, res) {
      if (i - (j + 1) >= 0) {
        Res[i][j] = Res[i - (j + 1)][i - 1];
      } else {
        temp++;
        Res[i][j] = temp;
      }
    }
  }
  rep(i, res + 1) {
    cout << res << " ";
    rep(j, res) { cout << Res[i][j] << " "; }
    cout << endl;
  }
}