Last active
July 24, 2017 14:26
-
-
Save say4n/add1bfe2aa25180529f078f9fd30e4c1 to your computer and use it in GitHub Desktop.
Competitive coding boilerplate
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 <iostream> | |
#include <iomanip> | |
#include <cstdlib> | |
#include <algorithm> | |
#include <fstream> | |
#include <cstdio> | |
#include <cmath> | |
#include <cstring> | |
#include <string> | |
#include <ctime> | |
#include <queue> | |
#include <stack> | |
#include <vector> | |
#include <map> | |
#include <set> | |
#include <deque> | |
#include <cassert> | |
#include <unordered_map> | |
#include <bitset> | |
#include <unordered_set> | |
using namespace std; | |
#define pb push_back | |
#define pp pop_back | |
#define f first | |
#define s second | |
#define mp make_pair | |
#define sz(a) (int)((a).size()) | |
#ifdef _WIN32 | |
# define I64 "%I64d" | |
#else | |
# define I64 "%lld" | |
#endif | |
#define fname "." | |
#defile all(c) (c).begin(),(c).end() | |
#define tr(c,i) for(auto i = (c).begin(); i != (c).end(); i++) | |
#define present(c,x) ((c).find(x) != (c).end()) | |
#define cpresent(c,x) (find(all(c),x) != (c).end()) | |
typedef long long ll; | |
typedef unsigned long long ull; | |
typedef long double ld; | |
typedef pair < int, int > pi; | |
typedef pair < ull, ull > pu; | |
typedef vector<int> vi; | |
typedef vector<vi> vvi; | |
const int inf = (int)1e9 + 123; | |
const ll infl = (ll)1e18 + 123; | |
const double eps = 1e-9; | |
const int MAX_N = (int)2e5 + 123; | |
const int mod = (int)1e9 + 7; | |
int main() { | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment