Problem p02977 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...)                                                               \
  do {                                                                         \
    cerr << __LINE__ << ": ";                                                  \
    dbgprint(#__VA_ARGS__, __VA_ARGS__);                                       \
  } while (0);

using namespace std;

namespace std {
template <class S, class T> struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T> struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v)
      h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v)
    os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v)
    os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);

  int n;
  cin >> n;
  if (n < 3 || __builtin_popcount(n) == 1) {
    cout << "No" << endl;
    return 0;
  }
  assert(n % 4);

  cout << "Yes" << endl;
  vector<pi> ans;
  ans.emplace_back(1, 2);
  ans.emplace_back(2, 3);
  ans.emplace_back(3, 1 + n);
  ans.emplace_back(1 + n, 2 + n);
  ans.emplace_back(2 + n, 3 + n);

  int N = (n + 3) / 4 * 4;
  if (n % 4 == 0) {
    N--;
    ans.emplace_back(n, n - 3);
    ans.emplace_back(n ^ (n - 3) ^ 1, n + n);
  }
  for (int i = 4; i <= N; i += 4) {
    if (i <= n)
      ans.emplace_back(1, i);
    if (i + 1 <= n)
      ans.emplace_back(1, i + 1);

    if (i + 1 <= n)
      ans.emplace_back(i, i + 1 + n);
    if (i + 1 <= n)
      ans.emplace_back(i + 1, i + n);
    if (i + 2 <= n)
      ans.emplace_back(i + 1, i + 2 + n);

    if (i + 2 <= n)
      ans.emplace_back(2, i + 2);
    if (i + 3 <= n)
      ans.emplace_back(3, i + 3);

    if (i + 3 <= n)
      ans.emplace_back(i + 2, i + 3 + n);
  }
  int cnt = 0;
  for (pi i : ans) {
    cnt++;
    cout << i.first << " " << i.second << endl;
  }
  dbg(n, cnt);
  assert(cnt == 2 * n - 1);
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...)                                                               \
  do {                                                                         \
    cerr << __LINE__ << ": ";                                                  \
    dbgprint(#__VA_ARGS__, __VA_ARGS__);                                       \
  } while (0);

using namespace std;

namespace std {
template <class S, class T> struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T> struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v)
      h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v)
    os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v)
    os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);

  int n;
  cin >> n;
  if (n < 3 || __builtin_popcount(n) == 1) {
    cout << "No" << endl;
    return 0;
  }
  // assert(n % 4);

  cout << "Yes" << endl;
  vector<pi> ans;
  ans.emplace_back(1, 2);
  ans.emplace_back(2, 3);
  ans.emplace_back(3, 1 + n);
  ans.emplace_back(1 + n, 2 + n);
  ans.emplace_back(2 + n, 3 + n);

  int N = (n + 3) / 4 * 4;
  if (n % 4 == 0) {
    N--;
    ans.emplace_back(n, n - 3);
    ans.emplace_back(n ^ (n - 3) ^ 1, n + n);
  }
  for (int i = 4; i <= N; i += 4) {
    if (i <= n)
      ans.emplace_back(1, i);
    if (i + 1 <= n)
      ans.emplace_back(1, i + 1);

    if (i + 1 <= n)
      ans.emplace_back(i, i + 1 + n);
    if (i + 1 <= n)
      ans.emplace_back(i + 1, i + n);
    if (i + 2 <= n)
      ans.emplace_back(i + 1, i + 2 + n);

    if (i + 2 <= n)
      ans.emplace_back(2, i + 2);
    if (i + 3 <= n)
      ans.emplace_back(3, i + 3);

    if (i + 3 <= n)
      ans.emplace_back(i + 2, i + 3 + n);
  }
  int cnt = 0;
  for (pi i : ans) {
    cnt++;
    cout << i.first << " " << i.second << endl;
  }
  dbg(n, cnt);
  assert(cnt == 2 * n - 1);
  return 0;
}