#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define

#define #define #define #define #define #define #define

<cstdio> <cmath> <cstdlib> <cctype> <cstring> <cassert> <iostream> <algorithm> <vector> <string> <queue> <stack> <set> <map> sz(a) int((a).size()) tr(c, i) for(typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i) all(c) (c).begin(),(c).end() uniq(c) sort(all((c))); (c).resize(unique(all((c))) - (c).begin()) lobo(c, x) (int) (lower_bound(all((c)), (x)) - (c).begin()) upbo(c, x) (int) (upper_bound(all((c)), (x)) - (c).begin()) mii(a, b) if(b < a) a = b maa(a, b) if(b > a) a = b

#define INF 2000000000 #define EPS 1e-5 #define PB push_back #define MP make_pair #define S second #define F first #define X first #define Y second #define DEBUG(x) printf("debugging.. %d\n", x); #ifdef TEST #define deb(...) fprintf(stderr, __VA_ARGS__) #else #define deb(...) #endif using namespace std; typedef long long ll; typedef pair <int, int> ii; string tobin(int x, int len) { string c; while(x) { c.PB(x%2+'0'); x /= 2; } while(sz(c) < len) c.PB('0'); reverse(all(c)); return c; } //-----------------------------int main() { return 0; }

Sign up to vote on this title
UsefulNot useful