diff --git a/C++/Debug.sublime-snippet b/C++/Debug.sublime-snippet
index 5000f84..c572740 100644
--- a/C++/Debug.sublime-snippet
+++ b/C++/Debug.sublime-snippet
@@ -1,7 +1,7 @@
int SIZE(const T (&t)[N]){ return N; } template int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template string to_string(const bitset &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template string to_string(const pair &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += '\n'; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += '\n'; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += '\n'; return res; } void dbgm(){;} template void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
+template int size(const T (&t)[N]){ return N; } template int size(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template string to_string(const bitset &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,size(b)), __jjj__ = min(x2, size(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template string to_string(const pair &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += '\n'; res += tab + "["; x1 = min(x1, size(v)), x2 = min(x2, size(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < size(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += '\n'; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += '\n'; return res; } template string to_string(const A (&v)[N], int x2) { return to_string(v, 0, x2); } void dbgm(){;} template void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
]]>
@@ -9,4 +9,4 @@ template int SIZE(const T (&t)[N]){ return N; } template<
source.c++
Debug
-
+
\ No newline at end of file
diff --git a/C++/Random Tree.sublime-snippet b/C++/Random Tree.sublime-snippet
new file mode 100644
index 0000000..30d6db3
--- /dev/null
+++ b/C++/Random Tree.sublime-snippet
@@ -0,0 +1,41 @@
+
+ pruefer(int n) {
+ vector code;
+ for (int i = 0; i < n - 2; i++) {
+ code.pb(rng() % (n - 2));
+ }
+
+ vector degree(n, 1);
+ for (int i : code)
+ degree[i]++;
+
+ int ptr = 0;
+ while (degree[ptr] != 1)
+ ptr++;
+ int leaf = ptr;
+
+ vector edges;
+ for (int v : code) {
+ edges.emplace_back(leaf, v);
+ if (--degree[v] == 1 && v < ptr) {
+ leaf = v;
+ } else {
+ ptr++;
+ while (degree[ptr] != 1)
+ ptr++;
+ leaf = ptr;
+ }
+ }
+ edges.emplace_back(leaf, n-1);
+ return edges;
+}
+]]>
+
+ randomTree
+
+ source.c++
+ Generate a random tree
+