1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
#include<bits/stdc++.h>
using namespace std;
const double eps=1e-6;
const double pi = acos(-1.0);
const long long INF=0x3fffffffffffffff;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
namespace DEFINITION
{
#define scanfll(a) scanf("%lld",&a)
#define lowbit(x) ((x)&(-(x)))
#define ALL(A) (A).begin(),(A).end()
#define SORT(A) sort(ALL(A))
#define SORT_REV(A) sort((A).rbegin(),(A).rend())
#define UNIQUE(A) A.erase(unique(ALL(A)),(A).end())
#define Presentation(i,r) " \n"[i==r]
#define FORLL(i,l,r) for(ll i=(l);i<=(r);i++)
#define FORLL_rev(i,r,l) for(ll i=(r);i>=(l);i--)
#define NO cout << "No\n"
#define YES cout << "Yes\n"
#define endl '\n'
}
namespace CCLIB
{
#define create_vec(v,n) vector<ll> v(n);for(auto &x:v) cin >> x;
ostream& operator<<(ostream &out, const pair<ll,ll> &p) {out << '(' << p.first << ',' << p.second << ')';return out;}
ll Exgcd(ll a,ll b,ll &x,ll &y) {if(a==0&&b==0) return -1; if(b==0) {x=1;y=0;return a;} ll d=Exgcd(b,a%b,y,x); y-=a/b*x; return d;}
template<typename T1,typename T2>
void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T1,typename T2>
void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<class T>
void print_vec(const T &A){for(auto &x:A) cout << x << ' ';cout << endl;}
void print_float(ld value,int digit=10){cout << fixed << setprecision(digit) << value;}
vector<ll> snums;
void Get_Nums(string s) { snums.clear(); ll i=0,cur=0,sgn=1,fl=0; while(i<s.size()) { if(s[i]=='-') sgn=-1; else if(s[i]>='0'&&s[i]<='9') { cur=cur*10+s[i]-'0';fl=1; } else if(fl) { snums.push_back(cur*sgn); cur=0; sgn=1; fl=0; } i++; } if(fl) snums.push_back(cur*sgn); }
}
namespace MODULE
{
ll MOD = 1e9+7;
inline ll Get_Mod(ll val,ll mod=MOD){
if(val<0) return val-val/mod*mod+mod;
else return val-val/mod*mod;
}
ll qcpow(ll a,ll b,ll p=MOD){ll ret=1;a=Get_Mod(a);for (;b;b>>=1,a=a*a%p) if(b&1) ret=ret*a%p;return ret;}
ll inv(ll a,ll p=MOD){return qcpow(a,p-2,p);}
inline ll add(ll a,ll b){return Get_Mod(a+b);}
inline ll sub(ll a,ll b){return Get_Mod(a-b);}
inline ll mul(ll a,ll b){return Get_Mod(a*b);}
inline ll frac(ll a,ll b){return Get_Mod(a*inv(b));}
void addto(ll &a,ll b){a=Get_Mod(a+b);}
void subto(ll &a,ll b){a=Get_Mod(a-b);}
void multo(ll &a,ll b){a=Get_Mod(a*b);}
vector<ll> Fac;
void Prepare_Factorial(ll n){Fac.resize(n+1);Fac[0]=1;for(ll i=1;i<=n;i++) Fac[i]=mul(Fac[i-1],i);}
inline ll C(ll n,ll m){return n<m?0:mul(Fac[n],inv(mul(Fac[m],Fac[n-m])));}
}
using namespace DEFINITION;
using namespace CCLIB;
#define ONLINE_JUDGE
#define FAST_IO
#define MUTIPLE_JUDGE
const ll N = 200005;
void prepare(){
MODULE::MOD = 1e9+7;
}
void solve()
{
}
signed main(){
#ifndef ONLINE_JUDGE
clock_t clk = clock();
ifstream ifs("1.in");
ofstream ofs("1.out");
streambuf *cinbackup;
cinbackup = cin.rdbuf(ifs.rdbuf());
streambuf *coutbackup;
coutbackup = cout.rdbuf(ofs.rdbuf());
#endif
#ifdef FAST_IO
#ifdef ONLINE_JUDGE
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
#endif
#endif
long long T = 1;
#ifdef MUTIPLE_JUDGE
cin >> T;
#endif
prepare();
while(T--) solve();
#ifndef ONLINE_JUDGE
cin.rdbuf(cinbackup);
cout.rdbuf(coutbackup);
cout << clock() - clk << " ms\n";
#endif
return 0;
}
|
