-
Notifications
You must be signed in to change notification settings - Fork 0
/
Define.cpp
41 lines (39 loc) · 1.27 KB
/
Define.cpp
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
#include "bits/stdc++.h"
template <typename T>
T square(T x)
{
return x*x;
}
#define CSP printf("Case %d: ",Case)
#define CS cout << "Case " << Case << ": "
#define LL long long int
#define LI long int
#define LN str.length()
#define LN1 str1.length()
#define LN2 str2.length()
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define CO(Res) cout << Res << endl
#define LCM(A,B) (A / __gcd(A,B) ) * B
#define pb push_back
#define V_C vector <long int>
#define C_ Case++
#define AS(A,N) sort(A, A+N)
#define VS(V) sort(V.begin(), V.end())
#define VRS(V) sort(V.rbegin(), V.rend())
#define BNS(V,N) binary_search(V.begin(),V.end(), N)
#define maxall(V) *max_element(V.begin(),V.end())
#define minall(V) *min_element(V.begin(),V.end())
#define VD(V) for(int i = 0; i < V.size();i++) cout << V[i] << " "
#define AD(A,N) for(int i = 0; i < N; i++) cout << A[i] << " "
#define SQ(K,N) K * sqrt(N)
#define Sq(N) sqrt(N)
#define RT return 0
#define In freopen("In.txt", "r", stdin)
#define Out freopen("Out.txt", "w", stdout)
using namespace std;
int main()
{
}