Competition Programming starter template

template.cc

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <deque>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>

using namespace std;

#define REP(I, N) for (int I = 0; I < int(N); ++I)
#define FOR(I, A, B) for (int I = int(A); I < int(B); ++I)
#define DWN(I, B, A) for (int I = int(B - 1); I >= int(A); --I)
#define ECH(it, A) for (auto it = A.begin(); it != A.end(); ++it)

#define ALL(A) A.begin(), A.end()
#define CLR(A) A.clear()
#define CPY(A, B) memcpy(A, B, sizeof(A))
#define INS(A, P, B) A.insert(A.begin() + P, B)
#define ERS(A, P) A.erase(A.begin() + P)
#define SRT(A) sort(ALL(A))
#define SZ(A) int(A.size())
#define PB push_back
#define MP(A, B) make_pair(A, B)

typedef long long LL;
typedef double DB;
typedef vector<int> VI;

template<class T> inline void RST(T &A) {
    memset(A, 0, sizeof(A));
}
template<class T> inline void FLC(T &A, int x) {
    memset(A, x, sizeof(A));
}

template<class T> inline void checkMin(T &a, T b) {
    if (b < a) a = b;
}

template<class T> inline void checkMax(T &a, T b) {
    if (b > a) a = b;
}

const int INF = 0x3f3f3f3f;

/* -- Start from here -- */

int main(int argc, char *argv[])
{
}