头文件

备个份(๑´ω`๑)

#include <algorithm>#include <cctype>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>#include <map>#include <queue>#include <string>#define ALL(v) v.begin(), v.end()#define CLR(array) memset(array, 0, sizeof(array))#define DEBUG cout << "bug "#define FOR(i, n) for(int i = 0; i < n; i++)#define MEM(array) memset(array, 0x3f, sizeof(array))#define OFF(array) memset(array, -1, sizeof(array))#define PR(x) cout << #x << " = " << x << "  "#define PRLN(x) cout << #x << " = " << x << endl#define rep(i, a, b) for(int i = a; i <= b; i++)#define Rep(i, a, b) for(int i = a; i >= b; i--)#define repk(i, a, b) for(i = a; i <= b; i++)#define Repk(i, a, b) for(i = a; i >= b; i--)using namespace std;typedef long long ll;typedef pair<int, int> P;const int maxn = 1e5 + 5;#define ls id << 1#define lson id << 1, l, m#define root 1, 1, n#define rs id << 1 | 1#define rson id << 1 | 1, m + 1, r${4:void} solve(void) {}int main(void) {    freopen("F:\\\Desktop\\\in.txt", "r", stdin);    ${3:}    return 0;}