无聊存存~

#pragma comment(linker, "/STACK:102400000,102400000")#include<stdio.h>#include<string.h>#include<math.h>#include<stdlib.h>#include<ctype.h>#include<iostream>#include<algorithm>#include<stack>#include<queue>#include<map>#include<set>#include<vector>#include<string>using namespace std;#define ll long long#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n))#define clr_all(x,c) memset(x,c,sizeof(x))#define IT iterator#define ls rt<<1#define rs ls|1#define lson l,mid,ls#define rson mid+1,r,rs#define middle l+r>>1#define MOD 1000000007#define inf 0x3f3f3f3f#define eps (1e-8)#define PI 3.1415926535897932384626433832795#define E 2.7182818284590452353602874713527template <class T> T _min(T a,T b){return a<b? a:b;}template <class T> T _max(T a,T b){return a>b? a:b;}template <class T> T _abs(T a){return a>0? a:-a;}template <class T> T _mod(T a,T m){return a<m? (a<0? (a%m+m)%m:a):a%m;}template <class T> T _gcd(T a,T b){while(b){T t=b;b=a%b;a=t;}return a;}template <class T> void _swap(T &a,T &b){T t=b;b=a;a=t;}template <class T> void getmax(T &a,T b){a= a>b? a:b;}template <class T> void getmin(T &a,T b){a= (a!=-1 && a<b)? a:b;}int TS,cas=1;const int M=100000+5;int n;void run(){int i,j;}void presof(){}int main(){//freopen("input.txt","r",stdin);    //freopen("output.txt","w",stdout);presof();//run();while(~scanf("%d",&n)) run();//for(scanf("%d",&TS),cas=1;cas<=TS;cas++) run();return 0;}