header

短命女 2022-01-10 19:51 156阅读 0赞

看不懂的地方来这里看~

in理解为读入，out理解为输出就行了= =

#include <bits/stdc++.h>
    using namespace std;
    typedef double lf;
    typedef long long ll;
    typedef vector<ll> vll;
    typedef double long llf;
    typedef vector<int> vint;
    typedef pair<ll, ll> pll;
    typedef int unsigned uint;
    typedef pair<int, int> pii;
    typedef long long unsigned ull;
    
    #define fi first
    #define se second
    #define pb push_back
    #define mp make_pair
    #define all(x) (x).begin(), (x).end()
    #define dl1(i,b) for(int i = (b); i >= 1; --i)
    #define dl0(i,b) for(int i = (b)-1; i >= 0; --i)
    #define lo0(i,b) for(int i = 0, i##end = (b); i < i##end; ++i)
    #define lo1(i,b) for(int i = 1, i##end = (b); i <= i##end; ++i)
    #define lo(i,a,b) for(int i = (a), i##end = (b); i <= i##end; ++i)
    #define dl(i,a,b) for(int i = (a), i##end = (b); i >= i##end; --i)
    #define trav(it, a) for(__typeof((a).end())it = (a).begin(); it != (a).end(); ++it)
    #define dtrav(it, a) for(__typeof((a).rend())it = (a).rbegin(); it != (a).rend(); ++it)
    inline uint Rand() {static uint x = time(0) ^ (ull)(new char); x ^= (x ^= (x ^= x << 13) >> 17) << 5; return x;}
    template<class T> inline T sqr(T x) {return x * x;} template<class T> inline T abs(T x) {return x >= 0 ? x : -x;}
    template<class A, class B> inline A max(A a, B b) {return a > b ? a : b;} template<class A, class B> inline A min(A a, B b) {return a < b ? a : b;}
    template<class A, class B> inline bool chmax(A &x, B y) {return x < y ? x = y, 1 : 0;} template<class A, class B> inline bool chmin(A &x, B y) {return x > y ? x = y, 1 : 0;}
    template<class A, class B> A _gcd(A a, B b) {while (b) {int t = a % b; a = b, b = t;} return a;}
    template<class A, class B> inline ll _lcm(A a, B b) {assert(a || b); return a / _gcd(a, b) * 1ll * b;}
    const int N = 1e5 + 7, P = 998244353, inft = 1e9 + 7; const lf eps = 1e-7; const ll infl = llf(1e18) + 1;
    template<class A, class B> ll mul(A a, B b, ll mod) {if (b < 0) b = -b, a = -a; ll ret; for (ret = 0; b; b >>= 1) {if (b & 1) ret = (ret + a) % mod; a = (a + a) % mod;} return (ret + mod) % mod;} template<class A, class B> A Pow1(A a, B b, int mod) {A ret; for (ret = 1; b; b >>= 1) {if (b & 1) ret = ret * 1ll * a % mod; a = a * 1ll * a % mod;} return (ret + mod) % mod;} template<class A, class B> ll Pow(A a, B b, ll mod = P) {assert(b >= 0); a %= mod; if (mod <= 1050000000) return Pow1(a, b, mod); ll ret; for (ret = 1; b; b >>= 1) {if (b & 1) ret = mul(ret, a, mod); a = mul(a, a, mod);} return (ret + mod) % mod;}
    
    
    namespace QvvQ {
    
    void init() {
    
    }
    
    void solve() {
      
    }
    
    }
    
    int main() {
    #ifdef QvvQ
      // freopen("data.in", "r", stdin);
      // freopen("data.out", "w", stdout);
      Dbg = 1;
    #endif
      int T = 1;
      while (T--) QvvQ::init(), QvvQ::solve();
    #ifdef QvvQ
      fprintf(stderr, "\ntime:%.5fms", clock() * 1000.0 / CLOCKS_PER_SEC);
    #endif
      return 0;
    }

转载于:https://www.cnblogs.com/storz/p/10577203.html