CF模板

最新推荐文章于 2022-08-08 11:50:05 发布

Linfanty

最新推荐文章于 2022-08-08 11:50:05 发布

阅读量293

点赞数

分类专栏： codeforce

本文链接：https://blog.csdn.net/Linfanty/article/details/79331295

版权

codeforce 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f3f;
#define show(a) cout<<#a<<" = "<<a<<endl
#define show2(b,c) cout<<#b<<" = "<<b<<" "<<#c<<" = "<<c<<endl
#define show3(a,b,c) cout<<#a<<" = "<<a<<" "<<#b<<" = "<<b<<" "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cout<<#a<<" = "<<a<<" "<<#b<<" = "<<b<<" "<<#c<<" = "<<c<<" "<<#d<<" = "<<d<<endl
const int maxn = 100005;
#define LOCAL

int main() {
    #ifdef LOCAL
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    // cin.tie(0);cin.sync_with_stdio(false);
    // priority_queue<ll,vector<ll>,greater<ll> > pq;//!empty() before pop()
    // vector<ll> vc; deque<ll> dq;
    // vector<ll>::iterator it = vc.begin();
    // map<ll, ll> mp; set<ll> st;// 去重
    // map<ll, ll>::reverse_iterator it; // rbegin rend it->first it-second
    //（n&(1<<i)) n=(n|(1<<i) n=(n&(~(1<<i)) (n&(-n))//判置10最后1 20(10100)得4(100)
    // ll Bs=0;ll t102(ll x){ll mid=x%2;if(x>=2)t102(x>>1);Bs=Bs*10 + mid;}ll Binary(ll x){t102(x);return Bs;}
    // string BinaryS(ll n) {string s="";for(ll a=n;a;a=a/2) s=s+(a%2?'1':'0');reverse(s.begin(),s.end());return s;}
    #endif

    ll n; cin >> n;
    ll m; cin >> m;
    /* code */
    
    
}