Siddharth CPP Template

{
    "template": {
        "prefix": "temp",
        "body": [
          "//Siddharth Jha",
          "",
          "#include<bits/stdc++.h>",
          "//#include<ext/pb_ds/assoc_container.hpp>",
          "//#include<ext/pb_ds/tree_policy.hpp>",
          "//#include <ext/pb_ds/trie_policy.hpp>",
          "//using namespace __gnu_pbds;",
          "using namespace std;",
          "//typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;",
          "//typedef trie<string,null_type,trie_string_access_traits<>,pat_trie_tag,trie_prefix_search_node_update> pbtrie;",
          "",
          "#define ll                       long long int",
          "#define mod                      1000000007",
          "#define inf                      1e18",
          "#define pb                       push_back",
          "#define vi                       vector<ll>",
          "#define vs                       vector<string>",
          "#define pii                      pair<ll,ll>",
          "#define ump                      unordered_map",
          "#define mp                       make_pair",
          "#define pq_max                   priority_queue<ll>",
          "#define pq_min                   priority_queue<ll,vi,greater<ll> >",
          "#define all(n)                   n.begin(),n.end()",
          "#define ff                       first",
          "#define ss                       second",
          "#define mid(l,r)                 (l+(r-l)/2)",
          "#define bitc(n)                  __builtin_popcount(n)",
          "#define SET(a)                   memset( a, -1, sizeof a )",
          "#define CLR(a)                   memset( a,  0, sizeof a )",
          "#define Pi                       3.141592653589793",
          "#define loop(x,start,end)        for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))",
          "#define _fast                    ios_base::sync_with_stdio(0);  cin.tie(0); cout.tie(0);",
          "#define iter(container,it)       for(__typeof(container.begin()) it = container.begin(); it != container.end(); it++)",
          "#define log(args...)             {string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }",
          "#define logarr(arr,a,b)          for(int z=(a);z<=(b);z++) cout<<(arr[z])<<\" \";cout<<endl;",
          "template <typename T> T          gcd(T a, T b){if(a%b) return gcd(b,a%b);return b;}",
          "template <typename T> T          lcm(T a, T b){return (a*(b/gcd(a,b)));}",
          "vs tokenizer(string str,char ch) {std::istringstream var((str)); vs v; string t; while(getline((var), t, (ch))) {v.pb(t);} return v;}",
          "",
          "void err(istream_iterator<string> it) {}",
          "template<typename T, typename... Args>",
          "void err(istream_iterator<string> it, T a, Args... args) {",
          "cout << *it << \" = \" << a << endl;",
          "err(++it, args...);",
          "}",
          "",
          "void solve() {",
          "",
          "}",
          "",
          "int main(int argc, char const *argv[]){",
          "    _fast",
          "  //#ifndef ONLINE_JUDGE",
          "        //freopen(\"input.txt\", \"r\", stdin);",
          "        //freopen(\"output.txt\", \"w\", stdout);",
          "  //#endif",
          "    ll t; cin>>t;",
          "    while(t--){",
          "     solve();",
          "    }",
          "  return 0;",
          "}"
        ],
        "description": ""
      },
      "template 2": {
        "prefix": "matrix",
        "body": [
          "const int MOD = 1e9 +7 ;",
          "const long long MOD2 = static_cast <long long> (MOD)*MOD;",
          "",
          "struct Matrix {",
          "  vector < vector <int> > mat;",
          "  int n_rows,n_cols;",
          "",
          "  Matrix() {}",
          "",
          "  Matrix (vector < vector<int> > values) : mat(values), n_rows(values.size()),",
          "          n_cols(values[0].size()) {}",
          "",
          "  static Matrix identity_matrix (int n) { ",
          "     vector < vector <int> > values(n, vector <int> (n,0));",
          "     for (int i=0; i<n; i++) values[i][i] = 1;",
          "     return values;",
          "  }",
          "  Matrix operator* (const Matrix &other) const {",
          "    int n = n_rows, m = n_cols;",
          "    vector < vector <int> > result (n_rows, vector<int> (n_cols,0));",
          "    for (int i=0; i<n; i++)",
          "      for (int j=0; j<m; j++) {",
          "        long long tmp = 0;",
          "        for (int k=0; k < n_cols; k++) {",
          "            tmp += mat[i][k] * 1ll * other.mat[k][j];",
          "            while (tmp >= MOD2) tmp -= MOD2;",
          "        }",
          "        result[i][j] = tmp % MOD;",
          "      }",
          "    return move(Matrix(move(result)));",
          "  } ",
          "  inline bool is_square () const { return n_rows == n_cols;}",
          "};",
          "",
          "Matrix pw (Matrix a, int p) {",
          "  Matrix result = Matrix::identity_matrix(a.n_cols);",
          "  while (p>0) {",
          "    if (p&1) result = a*result;",
          "    a = a*a;",
          "    p >>= 1;",
          "  }",
          "  return result;",
          "}"
        ],
        "description": ""
      },
      "template 3": {
        "prefix": "bin_expo",
        "body": [
          "ll binpow(ll a, ll b, ll m) {",
          "    a %= m;",
          "    ll res = 1;",
          "    while (b > 0) {",
          "        if (b & 1)",
          "            res = res * a % m;",
          "        a = a * a % m;",
          "        b >>= 1;",
          "    }",
          "    return res;",
          "}"
        ],
        "description": ""
      },
      "DSU": {
        "prefix": "dsu",
        "body": [
          "class DSU {",
          "    vi p,rank;",
          "    public :",
          "    DSU(ll n) {",
          "        p.resize(n+1,0),rank.resize(n+1,0);",
          "        loop (i,0,n) p[i] = i;",
          "    }",
          "",
          "    ll Get (ll a) {",
          "        return p[a] = (p[a] == a) ? a : Get(p[a]);",
          "    }",
          "",
          "    void Union (ll a, ll b) {",
          "        a = Get(a), b = Get(b);",
          "        if (a == b) return;",
          "        if (rank[a] > rank[b])",
          "            p[b] = a, rank[a]++;",
          "        else",
          "            p[a] = b, rank[b]++;",
          "    }",
          "};"
        ],
        "description": "DSU"
      }
    }