Created
June 30, 2019 03:42
-
-
Save satos---jp/2c1844248f6d181f61671b539c77a46f to your computer and use it in GitHub Desktop.
template.cpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<cstdio> | |
#include<cstring> | |
#include<vector> | |
#include<queue> | |
#include<algorithm> | |
#include<cmath> | |
#include<climits> | |
#include<string> | |
#include<set> | |
#include<map> | |
#include<iostream> | |
using namespace std; | |
#define rep(i,n) for(int i=0;i<((int)(n));i++) | |
#define reg(i,a,b) for(int i=((int)(a));i<=((int)(b));i++) | |
#define irep(i,n) for(int i=((int)(n))-1;i>=0;i--) | |
#define ireg(i,a,b) for(int i=((int)(b));i>=((int)(a));i--) | |
typedef long long int lli; | |
typedef pair<int,int> mp; | |
#define fir first | |
#define sec second | |
#define IINF INT_MAX | |
#define LINF LLONG_MAX | |
#define eprintf(...) fprintf(stderr,__VA_ARGS__) | |
#define pque(type) priority_queue<type,vector<type>,greater<type> > | |
#define memst(a,b) memset(a,b,sizeof(a)) | |
#define iter(v,ite) for(auto ite=(v).begin();ite!=(v).end();ite++) | |
#define mimunum(v,x) distance((v).begin(),lower_bound((v).begin(),(v).end(),x)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment