【笔记】C++缺省源

/*
	Author: Sean_xzx
	Right Output! & Accepted!
本题核心：
1.
本题步骤：
1.
*/
#include <bits/stdc++.h>
 
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define pre(i, a, b) for(int i = (a); i >= (b); i--)
#define fz(i, a, b) for(int i = (a); i <= (b); i++)
#define fr(i, a, b) for(int i = (a); i >= (b); i--)
#define ufz(i, a, b) for(int i = (a); i < (b); i++)
#define ufr(i, a, b) for(int i = (a); i > (b); i--)
#define rp(i, a) for(int i = 1; i <= (a); i++)
#define pr(i, a) for(int i = (a); i >= 1; i--)
#define urp(i, a) for(int i = 0; i < (a); i++)
#define upr(i, a) for(int i = (a); i > 0; i--)
#define go(i, a) for(auto i : (a))
 
//#define int long long
#define LL long long
#define ULL unsigned long long
#define PII pair<int, int>
#define PIL pair<int, long long>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pf push_front
#define sf scanf
#define prf printf
#define fi first
#define se second
#define bl putchar(' ')
#define el putchar('\n')
#define mem(arr, n) memset(arr, n, sizeof(arr))
#define mset(arr, n) memset(arr, n, sizeof(arr))
#define mcpy(arr, n) memcpy(arr, n, sizeof(arr))
#define mms(arr, n) memset(arr, n, sizeof(arr))
#define mmc(arr, n) memcpy(arr, n, sizeof(arr))
#define mmc(arr1, arr2) memcpy(arr1, arr2, sizeof(arr2))
const double eps15 = 1e-15, eps8 = 1e-8, pi = 3.1415926535;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}, inf = 0x7fffffff, inf_ = 0x80000000, inf3f = 0x3f3f3f3f;
const LL INF = 0x7fffffffffffffffLL, INF_ = 0x8000000000000000LL, INF3f = 0x3f3f3f3f3f3f3f3fLL;
//const int bas = 229;
const int mod = 1e9 + 7;
//const int mod = 998244353;
//const int mod = ; 
int gcd(int a, int b){ return b ? gcd(b, a % b) : a;}
int lcm(int a, int b){ return a / gcd(a, b) * b;}
template <typename T> T cmx(T a, T b){ return a > b ? a : b;}
template <typename T> T cmn(T a, T b){ return a < b ? a : b;}
template <typename T> T ad(T a, T b){ return (a + b) >= mod ? (a + b - mod) : (a + b);}
template <typename T> T su(T a, T b){ return (a - b) < 0 ? (a - b + mod) : (a - b);}
template <typename T> T mul(T a, T b, int p){ return (a % p) * (b % p) % p;}
int qmi(LL a, int k, int p){ int res = 1; for(; k; k >>= 1, a = mul(a, a, p)) if(k & 1){ res = mul((LL)res, a, p);} return res;}
int inv(int a, int p){ return qmi(a, p - 2, p);}

template <typename T> inline void rd(T &x){
	x = 0; bool f = true; char ch = getchar();
	while(ch < '0' || ch > '9'){ if(ch == '-') f = false; ch = getchar();}
	while(ch >= '0' && ch <= '9'){ x = (x << 1) + (x << 3) + (ch ^ '0'); ch = getchar();}
	if(!f) x = -x;
}
template <typename T, typename ...Args> inline void rd(T &x, Args &...args){ rd(x); rd(args...);}
template <typename T> inline void wr(T x){
	int sta[65], top = 0;
	do{ sta[++top] = x % 10; x /= 10;} while(x);
	while(top){ putchar(sta[top--] + '0');}
}
template <typename T, typename ...Args> inline void wr(T x, Args ...args){ wr(x); wr(args...);} 
/***********************************************code under the there***********************************************/
using namespace std;
 
int main(){
	/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
	*/
	
	
	return 0;
}

#include <bits/stdc++.h>

#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define pre(i, a, b) for(int i = (a); i >= (b); i--)
#define Ede(i, u) for(int i = h[u]; i; i = ne[i])
#define go(i, a) for(auto i : a)
//#define int long long
#define LL long long
#define ULL unsigned long long
#define PII pair<int, int>
#define PIL pair<int, long long>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pf push_front
#define sf scanf
#define prf printf
#define fi first
#define se second
#define el putchar('\n')
#define mms(arr, n) memset(arr, n, sizeof(arr))
#define mmc(arr1, arr2) memcpy(arr1, arr2, sizeof(arr2))
const int inf = 0x3f3f3f3f;

template <typename T> inline void rd(T &x){
	x = 0; bool f = true; char ch = getchar();
	while(ch < '0' || ch > '9'){ if(ch == '-') f = false; ch = getchar();}
	while(ch >= '0' && ch <= '9'){ x = (x << 1) + (x << 3) + (ch ^ '0'); ch = getchar();}
	if(!f) x = -x;
}
template <typename T, typename ...Args> inline void rd(T &x, Args &...args){ rd(x); rd(args...);}

using namespace std;
 
int main(){
	/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
	*/
	
	
	return 0;
}