Last active
December 31, 2015 10:09
-
-
Save MiSawa/7971724 to your computer and use it in GitHub Desktop.
This file contains hidden or 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 <string> | |
#include <vector> | |
#include <deque> | |
#include <stack> | |
#include <queue> | |
#include <set> | |
#include <map> | |
#include <list> | |
#include <bitset> | |
#include <utility> | |
#include <algorithm> | |
#include <numeric> | |
#include <complex> | |
#include <functional> | |
#include <memory> | |
#include <sstream> | |
#include <iomanip> | |
#include <iterator> | |
#include <cstdio> | |
#include <cmath> | |
#include <cstdlib> | |
#include <cstring> | |
#include <climits> | |
#include <cfloat> | |
#include <cassert> | |
#include <ctime> | |
#include <cctype>//}}} | |
#define REP(i,b,n) for(int i=(int)(b);i<(int)(n);++i)//{{{ | |
#define rep(i,n) REP(i,0,n) | |
#define repsz(i,v) rep(i,sz(v)) | |
#define let(v, x) __typeof(x) v = (x) | |
#define foreach(i,v) for(let(i, (v).begin());i!=(v).end();i++) | |
#define pb push_back | |
#define mp make_pair | |
#define fst first | |
#define snd second | |
#define all(x) (x).begin(),(x).end() | |
#define rall(x) (x).rbegin(),(x).rend() | |
#define sz(x) ((int)(x).size()) //}}} | |
static const int INF = 1<<25; | |
static const double EPS = 1e-5; | |
using namespace std;//{{{ | |
typedef long long ll; | |
typedef unsigned long long ull; | |
typedef vector<int> vi; | |
typedef vector<vi> vvi; | |
typedef pair<int,int> pii; | |
typedef pair<int,pii> pipii;//}}} | |
template<typename T> ostream& out(T b, T e, ostream& os=cout){ //{{{ | |
for(; b != e; ++b != e && os << ", ")os << *b; return os; | |
} | |
template<class T> T mineq(T &a, const T &b){ return a = min(a, b); } | |
template<class T> T maxeq(T &a, const T &b){ return a = max(a, b); } //}}} | |
bool solve(){ | |
return true; | |
} | |
int main(){ | |
//cin.tie(0); | |
//ios_base::sync_with_stdio(0); | |
cout.setf(ios::fixed); cout.precision(10); | |
solve(); | |
return 0; | |
} | |
// vim:set foldmethod=marker commentstring=//%s: |
This file contains hidden or 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 <bits/stdc++.h> | |
#define int long long | |
#define sz(x) ((int)(x).size()) | |
#define REP(i,b,n) for(int i=(int)(b);i<(int)(n);++i) | |
#define rep(i,n) REP(i,0,n) | |
#define repsz(i,v) rep(i,sz(v)) | |
#define let(v, x) __typeof(x) v = (x) | |
#define foreach(i,v) for(let(i, (v).begin());i!=(v).end();i++) | |
#define pb push_back | |
#define eb emplace_back | |
#define mp make_pair | |
#define fst first | |
#define snd second | |
#define all(x) (x).begin(),(x).end() | |
#define rall(x) (x).rbegin(),(x).rend() | |
static const int INF = 1LL<<50; | |
static const double EPS = 1e-5; | |
using namespace std; | |
typedef vector<int> vi; | |
typedef vector<vi> vvi; | |
typedef pair<int,int> pii; | |
template<typename T> ostream& operator<<(ostream& os, const T& v){ | |
copy(all(v), ostream_iterator<typename T::iterator::value_type>(os, ", ")); return os; | |
} | |
template<class T> T mineq(T &a, const T &b){ return a = min(a, b); } | |
template<class T> T maxeq(T &a, const T &b){ return a = max(a, b); } | |
bool solve(){ | |
return true; | |
} | |
signed main(){ | |
//cin.tie(0); | |
//ios_base::sync_with_stdio(0); | |
cout.setf(ios::fixed); cout.precision(10); | |
solve(); | |
return 0; | |
} | |
// vim:set foldmethod=marker commentstring=//%s: |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment