读优

读入

template<typename T>bool in(T&a)
{
	for(FL=1;!isdigit(CH)&&CH!=EOF;CH=getchar())
		if(CH=='-')FL=-1;
	for(a=0;isdigit(CH);CH=getchar())
		a=a*10+CH-'0';
	return a*=FL,CH==EOF?0:1;
}
template<typename T,typename...Args>int in(T&a,Args&...args){return in(a)+in(args...);}

缺省源

顺便存下，以后有改动再$upd$。
计划存个壮观又方便的（包含常用的所有#define的那种。

• 简约版：

#include<bits/stdc++.h>
#define cs const
#define il inline
#define LL long long
#define pc(i) putchar(i)
#define fo(i,j,k) for(int i=(j);(i)<=(k);++(i))
#define of(i,j,k) for(int i=(j);(i)>=(k);--(i))
using namespace std;
mt19937 srd(time(0));
cs int inf=0x3f3f3f3f,Mod=998244353;
int FL,CH;
template<typename T> bool in(T&a)
{
    for(FL=1;!isdigit(CH)&&CH!=EOF;CH=getchar())
        if(CH=='-')FL=-1;
    for(a=0;isdigit(CH);CH=getchar())
        a=a*10+CH-'0';
    return a*=FL,CH==EOF?0:1;
}
template<typename T,typename...Args>
int in(T&a,Args&...args){return in(a)+in(args...);}
void wt(int x){if(x<0)x=-x,pc('-');if(x>9)wt(x/10);pc(x%10|48);}
signed main()
{

    return 0;
}

• 不简约版:

#include<bits/stdc++.h>
#define cs const
#define il inline
#define pc(i) putchar(i)
#define LL long long
#define fi first
#define se second
#define pub push_back
#define rdm(a,b) ((a)+srd()%((b)-(a)+1))
#define fo(i,j,k) for(int i=(j);(i)<=(k);++(i))
#define of(i,j,k) for(int i=(j);(i)>=(k);--(i))
#define pii pair<int,int>
#define debug printf("now is Line %d.\n",__LINE__);
using namespace std;
mt19937 srd(time(0));
cs int inf=1e9+7,Mod=998244353;
int FL,CH;
template<typename T> bool in(T&a)
{
    for(FL=1;!isdigit(CH)&&CH!=EOF;CH=getchar())
        if(CH=='-')FL=-1;
    for(a=0;isdigit(CH);CH=getchar())
        a=a*10+CH-'0';
    return a*=FL,CH==EOF?0:1;
}
template<typename T,typename...Args>
int in(T&a,Args&...args){return in(a)+in(args...);}
void wt(int x){if(x<0)x=-x,pc('-');if(x>9)wt(x/10);pc(x%10|48);}
signed main()
{

    return 0;
}