Skip to content

Instantly share code, notes, and snippets.

@dejw
Created October 31, 2009 21:51
Show Gist options
  • Select an option

  • Save dejw/223262 to your computer and use it in GitHub Desktop.

Select an option

Save dejw/223262 to your computer and use it in GitHub Desktop.
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <cmath>
#include <utility>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef stack<int> si;
#define REP(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define FORR(i,a,b) for(int i=(a); i>(b); i--)
#define ITER(it,c) typeof((c).begin()) it
#define EACH(it,c) for( ITER(it, c) =(c).begin(); it!=(c).end(); it++)
#define ALL(c) (c).begin(), (c).end()
#define POLL(c) (c).erase((c).begin())
#define LAST(c) *(--(c).end())
#define INF (1/0.0)
#define INT_INF INT_MAX
#define MP make_pair
#define ST first
#define ND second
#define EPS 10e-9
template<class T>
T _pop(stack<T> &s){
T x = s.top();
s.pop();
return x;
}
int main(){
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment