competitiveGoodAlgos/template.cpp at master · kg16/competitiveGoodAlgos · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
//Problem Statement -

#include <bits/stdc++.h>
#include <map>
#include <unordered_map>
#include <algorithm>
using namespace std;

//Author: Varun Goyal: govarun

#define f(i, n)    for(int i = 0; i < (n); ++i)
#define fa(i, a, n)  for(int i = (a); i <= (n); ++i)
#define fd(i, a, n)  for(int i = (a); i >= (n); --i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a)  memset(a, 0, sizeof (a))
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define popb pop_back
#define ull unsigned long long
#define DEBUG(x) cout << "> " << #x << ':' << x << endl;
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
inline bool EQ(double a, double b) {
return fabs(a-b) < 1e-9; }
inline int two(int n) { return 1 << n; }

const ll mod = 1e9+7;

void pre(){


}

void solve(){


}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    pre();

    return 0;
}