-
Notifications
You must be signed in to change notification settings - Fork 0
/
template.cpp
42 lines (37 loc) · 950 Bytes
/
template.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
// BEGIN CUT HERE
#define _GLIBCXX_DEBUG
#include "cout.h"
// END CUT HERE
#line $NEXTLINENUMBER$ "$FILENAME$"
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cmath>
#include <queue>
#include <list>
#include <complex>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef long long LL;
typedef complex<double> CMP;
#define Fill(a, b) memset((a), (b), sizeof(a))
#define REP(a, b) for (size_t (a) = 0; (a)<(size_t)(b); ++(a))
#define sz size()
#define Tr(c, i) for(typeof((c).begin()) i= (c).begin(); (i) != (c).end(); ++(i))
#define All(c) (c).begin(), (c).end()
#define Present(c, x) ((c).find(x) != (c).end()) // for Map or Set
#define CPresent(c, x) (find(All(c), x) != end()) // for vector
class $CLASSNAME$ {
public:
$RC$ $METHODNAME$($METHODPARMS$) {
$RC$ ret;
return ret;
}
};
$TESTCODE$