不定时开播

绿蓝勾的下限是负分。

AcWing

GitHub

Luogu

#include<bits/stdc++.h>
using namespace std;
template<typename T>void gmx(T &x,T y){x=max(x,y);}
template<typename T>void gmn(T &x,T y){x=min(x,y);}
template<typename T>void read(T&x){x=0;int f=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')f=-f;for(;c>='0'&&c<='9';c=getchar())x=x*10+c-'0';x*=f;}
template<int P>class mod_int{using Z=mod_int;private:static int mo(int x){return x<0?x+P:x;}public:int x;int val()const{return x;}mod_int():x(0){}template<class T>mod_int(const T&x_):x(x_>=0&&x_<P?static_cast<int>(x_):mo(static_cast<int>(x_%P))){}bool operator==(const Z&rhs)const{return x==rhs.x;}bool operator!=(const Z&rhs)const{return x!=rhs.x;}Z operator-()const{return Z(x?P-x:0);}Z pow(long long k)const{Z res=1,t=*this;while(k){if(k&1)res*=t;if(k>>=1)t*=t;}return res;}Z&operator++(){x<P-1?++x:x=0;return*this;}Z&operator--(){x?--x:x=P-1;return*this;}Z operator++(int){Z ret=x;x<P-1?++x:x=0;return ret;}Z operator--(int){Z ret=x;x?--x:x=P-1;return ret;}Z inv()const{return pow(P-2);}Z&operator+=(const Z&rhs){(x+=rhs.x)>=P&&(x-=P);return*this;}Z&operator-=(const Z&rhs){(x-=rhs.x)<0&&(x+=P);return*this;}Z operator-(){return-x;}Z&operator*=(const Z&rhs){x=1ULL*x*rhs.x%P;return*this;}Z&operator/=(const Z&rhs){return*this*=rhs.inv();}
#define setO(T,o)friend T operator o(const Z&lhs,const Z&rhs){Z res=lhs;return res o##=rhs;}
setO(Z,+)setO(Z,-)setO(Z,*)setO(Z,/)
#undef setO
friend istream&operator>>(istream&is,mod_int&x){long long tmp;is>>tmp;x=tmp;return is;}friend ostream&operator<<(ostream&os,const mod_int&x){os<<x.val();return os;}};
void solve()
{
    
}
int main()
{
    int t;cin>>t;while(t--)
    solve();
    return 0;
}