본문 바로가기

Algorithm/Tip

Heewon's Template

#include <bits/stdc++.h>
using namespace std;
#define fastio cin.tie(0)->sync_with_stdio(0)
#define fi first
#define se second
#define nm (nl + nr >> 1)
#define pb(x) push_back(x)
#define all(v) (v).begin(), (v).end()
#define zip(v) (v).erase(unique(all(v)), (v).end())
#define dem_plc(x) cout << fixed << setprecision(x)
#define ox(t) cout << ((t) ? "YES" : "NO") << '\n'
#define continue(x) { cout << (x) << '\n'; continue; }
#define myexit(x) return cout << x, 0
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<pii, int> ppi;
typedef pair<int, pii> pip;
typedef pair<pll, ll> ppl;
typedef pair<ll, pll> plp;
const ll mod = 1e9 + 7;
const ll INF = 2e9;
const ll LINF = 4e18;
const db PI = acos(-1);
const int N = 2e5 + 1;
// templete end

int main()
{
    fastio;
    int tc = 1; cin >> tc;
    while(tc--) {
        
    }
}

'Algorithm > Tip' 카테고리의 다른 글

알고리즘 미니 노트  (1) 2022.02.24
Heewon's Template  (0) 2021.01.17