題意#
(待補)
思路#
(待補)
程式碼#
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define INF LONG_LONG_MAX/1000
#define WA() cin.tie(0)->sync_with_stdio(0)
#define all(x) (x).begin(), (x).end()
#define int long long
#define PII pair<int, int>
int n, cnt = 0;
vector<int> v;
vector<pair<int, int>> g;
void dfs(int lv, int to) {
for (int i = lv; i; i--) {
if (v[i] != to) {
dfs(i-1, 6-v[i]-to);
g.pb({v[i], to});
v[i] = to;
cnt++;
}
}
}
signed main() { WA();
cin >> n;
v.assign(n+1, 1);
dfs(n, 3);
cout << cnt << '\n';
for (auto i : g) cout << i.fi << ' ' << i.se << '\n';
}
