普通比赛
#include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = (int)(j);i <= (int)(k);i ++)
#define per(i,j,k) for(int i = (int)(j);i >= (int)(k);i --)
#define mmm(a,b) memset(a,b,sizeof(a))
#define sz(x) ((int)(x).size())
#define pb push_back
typedef double db;
typedef long long ll;
const int INF = (int)0x3f3f3f3f;
const int MAXN = (int)1e5+7;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
}
prefer
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cstdio>
#include <string>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <sstream>
#include <memory>
#include <iostream>
#include <algorithm>
#include <functional>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = (int)(j);i <= (int)(k);i ++)
#define per(i,j,k) for(int i = (int)(j);i >= (int)(k);i --)
#define mmm(a,b) memset(a,b,sizeof(a))
#define sz(x) ((int)(x).size())
#define pb push_back
void text(){
srand(time(NULL));
freopen("in.txt","r",stdin);
freopen("outPr.txt","w",stdout);
}
int dir[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};
struct Pos{
int x,y;
int step;
Pos(int x = 0,int y = 0,int step = 0):x(x),y(y),step(step){}
};
typedef double db;
typedef long long ll;
const double PI = acos(-1.0);
const int INF = (int)0x3f3f3f3f;
const int MAXN = (int)1e6+7;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
}