GHD CF Template cpp

ghd_template.cpp

#pragma region Template
// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()

// print a vector of ints
void print_v(vector<int> v) {
    for(int i = 0; i < v.size(); i++) {
        cout<<v[i]<<" ";
    }
    cout<<endl;
}

// print a vector of bools
void print_v(vector<bool> v) {
    for(int i = 0; i < v.size(); i++) {
        char ch = v[i] ? '-' : 'F';
        cout<<ch<<" ";
    }
    cout<<endl;
}

// prefix sum
// partial_sum(B.begin(), B.end(), B.begin());

// postfix sum
// partial_sum(C.rbegin(), C.rend(), C.rbegin());

// sum(vector)
// int summ = accumulate(v.begin(), v.end(), 0);
#pragma endregion

void solve() {
    
}

int main()
{
    fast_cin();
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}