C++ Template for Competitive Programming

main.cpp

/*    Udit | CodeNirvana    */
#include <bits/stdc++.h>
using namespace std;

#define  PB             push_back
#define  MP             make_pair
#define  F              first
#define  S              second
#define  SZ(X)          ((int)(X).size())
#define  ALL(X)         (X).begin(), (X).end()
#define  S1(X)          scanf("%lld", &(X))
#define  S2(X, Y)       scanf("%lld%lld", &(X), &(Y))
#define  S3(X, Y, Z)    scanf("%lld%lld%lld", &(X), &(Y), &(Z))
#define  P1(X)          printf("%lld",(X))
#define  P2(X)          printf("%lld\n",(X))
#define  _              printf(" ");
#define  __             printf("\n");
#define  LEN(X)         strlen(X)
#define  MEM(a, b)      memset(a, (b), sizeof(a))
#define  MOD            1000000007
#define  INF            (int)1e9
#define  EPS            1e-9
#define  gcd(a, b)      __gcd(a, b)
#define  IOS            ios_base::sync_with_stdio(0);
#define  EACH(I, V)     for(auto I : V)
#define  REP(I, N)      for (LL I = 0; I < (N); ++I)
#define  REPP(I, A, B)  for (LL I = (A); I < (B); ++I)
#define  REPPP(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PII;
typedef vector<LL> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<LL,LL> MPII;
typedef set<LL> SETI;
typedef multiset<LL> MSETI;

int main(){IOS
    // your code goes here
    return 0;
}