卡常专用模板

  • 半年OI一场空,没模mod见祖宗
  • OI的世界需要模板
  • OI的世界更需要卡常
  • 卡掉了那一点常数你没准就能完美AC
#include<bits/stdc++.h>
//char B[1 << 20], *S = B, *T = B;
//#define getchar() (S == T && (T = (S = B) + fread(B, 1, 1 << 20, stdin), S == T) ? 0 : *S++)
#define ll long long
using namespace std;

const int mod = 998244353;

inline ll Abs(ll a) { return a < 0 ? -a : a; }

inline ll Max(ll a, ll b) { return a > b ? a : b; }
inline ll Min(ll a, ll b) { return a < b ? a : b; }

inline void chmax(ll &a, ll b) { a = Max(a, b); }
inline void chmin(ll &a, ll b) { b = Min(a, b); }

inline ll add(ll a, ll b) { return (a += b) >= mod ? a - mod : a; }
inline ll sub(ll a, ll b) { return (a -= b) < 0 ? a + mod : a; }
inline ll mul(ll a, ll b) { return a * b % mod; }

inline void Add(ll &a, ll b) { a = add(a, b); }
inline void Sub(ll &a, ll b) { a = sub(a, b); }
inline void Mul(ll &a, ll b) { a = mul(a, b); }

inline ll read() {
	ll s = 0, f = 1;
	char ch;
	for(; ch < '0' || ch > '9'; ch = getchar())	if(ch == '-')	f = -1;
	for(; ch >= '0' && ch <= '9'; ch = getchar())	s = (s << 1) + (s << 3) + ch - '0';
	return s * f;
}

inline string sread() {
	string s;
	char ch = getchar();
	for(; ch == '\n' || ch == ' '; ch = getchar());
	for(; ch != '\n' && ch != ' '; ch = getchar())	s += ch;
	return s;
}

inline char cread() {
	char ch = getchar();
	for(; ch == '\n' || ch == ' '; ch = getchar());
	return ch;
}

inline double dread() {
	ll s = 0, f = 1;
	double t = 0, tot = 0.1;
	char ch;
	for(; ch < '0' || ch > '9'; ch = getchar())	if(ch == '-')	f = -1;
	for(; ch >= '0' && ch <= '9'; ch = getchar())	s = (s << 1) + (s << 3) + ch - '0';
	if(ch == '.')	ch = getchar();
	for(; ch >= '0' && ch <= '9'; ch = getchar())	t += (ch - '0') * tot, tot /= 10;
	return f * (t + s);
}

inline void iprint(ll x) {
	if(x < 0)	putchar('-'), x = -x;
	if(x > 9)	iprint(x / 10);
	putchar(x % 10 + '0');
}

inline void print(ll x) { iprint(x); putchar('\n'); }

inline void sprint(string str) {
	int len = str.size();
	for(int i = 0; i < len; ++i)	putchar(str[i]);
	putchar('\n');
}

inline void cprint(char ch) { putchar(ch); putchar('\n'); }

int main() {
	
	return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值