SHOW:
|
|
- or go back to the newest paste.
| 1 | #pragma warning(disable: 4996) | |
| 2 | #pragma comment(linker,"/STACK:64000000") | |
| 3 | #include <iostream> | |
| 4 | #include <sstream> | |
| 5 | #include <stdio.h> | |
| 6 | #include <memory.h> | |
| 7 | #include <algorithm> | |
| 8 | #include <set> | |
| 9 | #include <map> | |
| 10 | #include <string> | |
| 11 | #include <cstring> | |
| 12 | #include <vector> | |
| 13 | #include <cmath> | |
| 14 | #include <queue> | |
| 15 | #include <deque> | |
| 16 | #include <stack> | |
| 17 | - | #include <cassert> |
| 17 | + | |
| 18 | #include <cstdlib> | |
| 19 | - | #include <bitset> |
| 19 | + | #include <stdlib.h> |
| 20 | ||
| 21 | using namespace std; | |
| 22 | ||
| 23 | #define mp make_pair | |
| 24 | #define pb push_back | |
| 25 | - | #define _(a,b) memset( (a), b, sizeof( a ) ) |
| 25 | + | #define _(a) memset( (a), 0, sizeof( a ) ) |
| 26 | #define all(a) a.begin(), a.end() | |
| 27 | #define sz(a) (int)a.size() | |
| 28 | #define forpl(i, a, b) for(int i = a; i <= b; i++) | |
| 29 | #define forn(i, n) for(int i = 0; i < n; i++) | |
| 30 | #define formn(i, a, b) for(int i = a; i >= b; i--) | |
| 31 | #define foreach(it, a) for(auto it = a.begin(); it != a.end(); ++it) | |
| 32 | ||
| 33 | typedef unsigned long long ull; | |
| 34 | typedef long long lint; | |
| 35 | typedef pair < int , int > pii; | |
| 36 | typedef long double ld; | |
| 37 | ||
| 38 | - | void prepare(string s) |
| 38 | + | |
| 39 | const lint LINF = 1000000000000000000LL; | |
| 40 | const double eps = 1e-9; | |
| 41 | ||
| 42 | - | #else |
| 42 | + | |
| 43 | - | if (sz(s) != 0) |
| 43 | + | |
| 44 | - | {
|
| 44 | + | |
| 45 | - | freopen((s + ".in").c_str(),"r",stdin); |
| 45 | + | |
| 46 | - | freopen((s + ".out").c_str(),"w",stdout); |
| 46 | + | |
| 47 | - | } |
| 47 | + | |
| 48 | } |