AT/CF缺省源

 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
#include<bits/stdc++.h>
#define int long long
#define MAX 100010
#define INF 4557430888798830399
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define piii pair<pii,int>
#define fi first
#define se second
using namespace std;

const int mod=998244353;
inline void Madd(int &a,int b){a=a+b>=mod?a+b-mod:a+b;}
inline void Mdel(int &a,int b){a=a-b<0?a-b+mod:a-b;}
inline void Mmul(int &a,int b){a=a*b%mod;}
inline int  Cadd(int a ,int b){return a+b>=mod?a+b-mod:a+b;}
inline int  Cdel(int a ,int b){return a-b<0?a-b+mod:a-b;}
inline int  Cmul(int a ,int b){return a*b%mod;}

int n,a[MAX],ans;

inline void solve()
{

}

signed main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    int T=1; //cin>>T;
    while(T--) solve();
    return (0-0);
}