#include<bits/stdc++.h> using namespace std; using LL = long long; using D = double; #define f1 first #define f2 second #define randint(a, b) uniform_int_distribution<int>{a, b}(gen) #ifdef LOC void OUT() {cout << '\n';} template<class H, class ... T> void OUT(H h, T ... t) { cout << h << ' '; OUT(t...); } #define P(...) cout << "[" << #__VA_ARGS__ << "] ", OUT(__VA_ARGS__) #else #define P(...) #define OUT(...) #endif //mt19937 gen; pair<int, int> verts[101]; int alloc = 0; int main(int, char ** /*args*/) { ios_base::sync_with_stdio(0); cin.tie(0); int k; cin >> k; const int numL = 31; for(int i = 0; i < numL; ++i) { verts[1 + i * 3] = {2 + i * 3, 3 + i * 3}; verts[2 + i * 3] = {4 + i * 3, -1}; verts[3 + i * 3] = {4 + i * 3, -1}; } const int nthVert = 2 + numL * 3; verts[nthVert] = {-1, -1}; verts[nthVert - 1] = {-1, -1}; for(int i = 0; i < numL; ++i) { if(k & (1<<i)) { verts[2 + i * 3].f2 = nthVert; } } cout << nthVert << '\n'; for(int i = 1; i <= nthVert; ++i) { cout << verts[i].f1 << ' ' << verts[i].f2 << '\n'; } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 | #include<bits/stdc++.h> using namespace std; using LL = long long; using D = double; #define f1 first #define f2 second #define randint(a, b) uniform_int_distribution<int>{a, b}(gen) #ifdef LOC void OUT() {cout << '\n';} template<class H, class ... T> void OUT(H h, T ... t) { cout << h << ' '; OUT(t...); } #define P(...) cout << "[" << #__VA_ARGS__ << "] ", OUT(__VA_ARGS__) #else #define P(...) #define OUT(...) #endif //mt19937 gen; pair<int, int> verts[101]; int alloc = 0; int main(int, char ** /*args*/) { ios_base::sync_with_stdio(0); cin.tie(0); int k; cin >> k; const int numL = 31; for(int i = 0; i < numL; ++i) { verts[1 + i * 3] = {2 + i * 3, 3 + i * 3}; verts[2 + i * 3] = {4 + i * 3, -1}; verts[3 + i * 3] = {4 + i * 3, -1}; } const int nthVert = 2 + numL * 3; verts[nthVert] = {-1, -1}; verts[nthVert - 1] = {-1, -1}; for(int i = 0; i < numL; ++i) { if(k & (1<<i)) { verts[2 + i * 3].f2 = nthVert; } } cout << nthVert << '\n'; for(int i = 1; i <= nthVert; ++i) { cout << verts[i].f1 << ' ' << verts[i].f2 << '\n'; } return 0; } |