#pragma warning(disable:4786)//使命名长度不受限制
#pragma comment(linker, "/STACK:102400000,102400000")//手工开栈
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<string>
#include<iostream>
#include<cstdio>
#define LL long long
#define INF 0x3f3f3f3f //int最大值
#define FOR(i,f_start,f_end) for(int i=f_start;i<=f_end;++i)
#define MT(x,i) memset(x,i,sizeof(x))
using namespace std;
const int N=1000000009;
const LL mod = 1e9 + 7;
const double PI = acos(-1.0);
const double E = exp(1);
const double EPS=1e-8;
int main()
{
#ifdef TSQ1
freopen("f:\\1.txt","r",stdin);
#endif // TSQ
int T,n;
scanf("%d",&T);
while(T--)
{
}
return 0;
}
/*
struct MT //结构体初始化
{
int a,b;
MT(int a=0,int b=0):a(a),b(b){}
};
MT m[26];
*/
ACM 头文件与宏定义 (以后有好的会随时更新)
最新推荐文章于 2023-03-07 23:04:28 发布