{ "__1csdm__": { "prefix": "__1csdm__", "body": [ "#include<bits/stdc++.h>", "using namespace std;", "typedef long long LL; typedef unsigned long long ULL; typedef long double LD;", "", "#define rep(I,A,B) for(int I=A, eax=B; I<=eax; ++I)", "#define repo(I,A,B) for(int I=A, eax=B; I< eax; ++I)", "#define REP(I,A,B) for( LL I=A, eax=B; I<=eax; ++I)", "#define REPO(I,A,B) for( LL I=A, eax=B; I< eax; ++I)", "#define reb(I,A,B) for(int I=A, eax=B; I>=eax; --I)", "#define rebo(I,A,B) for(int I=A, eax=B; I> eax; --I)", "#define REB(I,A,B) for( LL I=A, eax=B; I>=eax; --I)", "#define REBO(I,A,B) for( LL I=A, eax=B; I> eax; --I)", "#define times(A) reb(ID, A, 1)", "#define BtoE(I,A) for(auto I=A.begin(); I!=A.end(); ++I)", "#define EtoB(I,A) for(auto I=A.rbegin(); I!=A.rend(); ++I)", "", "typedef vector VI; typedef vector VL; typedef vector VC; ", "typedef vector VII, VVI; typedef vector VLL, VVL; typedef vector VCC, VVC; ", "template void push_back(vector&v, const T& e) {", " v.size()==v.capacity() && v.size()>1 && (v.reserve(v.size() + (v.size()>>1)), true), v.push_back(e); }", "", "#define FI first", "#define SE second", "typedef pair<int,int> pii; typedef pair<int,LL> pil; typedef pair<LL,int> pli; typedef pair<LL,LL> pll; ", "", "namespace Math {double pi=acos(-1), e=exp(1.0), gd=(sqrt(5)+1)/2, gam=0.5772156649; }; ", "", "#define maxHp(T) priority_queue", "#define minHp(T) priority_queue<T, vector, greater >", "#define Dsort(A,B,T) sort(A, B, greater())", "#define FileIO(A) freopen(A".in", "r", stdin), freopen(A".out", "w", stdout)", "", "const int inf=0x7F7F7F7F, inf2=inf/127*63, inf3=inf/127*42; ", "const LL INF=0x7F7F7F7F7F7F7F7F, INF2=INF/127*63, INF3=INF/127*42; ", "", "bool main(int taskID) {", " ", " return 0;", "}", "", "int main() {", " ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); ", " int tasks=1; //cin>>tasks; ", " repo(taskID, 0, tasks) if(main(taskID)) return 0; ", " return 0;", "}" ] }, }