Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <set>
- #include <map>
- #include <list>
- #include <cmath>
- #include <ctime>
- #include <deque>
- #include <queue>
- #include <stack>
- #include <cctype>
- #include <cstdio>
- #include <string>
- #include <vector>
- #include <cassert>
- #include <cstdlib>
- #include <cstring>
- #include <sstream>
- #include <iostream>
- #include <algorithm>
- #define fst first
- #define scd second
- #define pb push_back
- #define psp() printf( " " )
- #define pnl() printf( "\n" )
- #define sq( x ) ( (x) * (x) )
- #define phl() printf( "Hello World!!!" )
- #define pcase( x ) printf( "Case %d:", (x) )
- #define read( in ) freopen( (in), "r", stdin )
- #define write( out ) freopen( (out), "w", stdout )
- #define rep( i, a, b ) for( (i) = (a); (i) <= (b); (i)++ )
- #define rev( i, a, b ) for( (i) = (a); (i) >= (b); (i)-- )
- #define mems( arr, val ) memset( (arr), (val), sizeof( (arr) ) )
- #define dp1( x ) cout << (x) << endl
- #define dp2( x, y ) cout << (x) << " " << (y) << endl
- #define dp3( x, y, z ) cout << (x) << " " << (y) << " " << (z) << endl
- using namespace std;
- typedef long long ll;
- typedef set <int> si;
- typedef queue <int> qi;
- typedef vector <int> vi;
- typedef pair <ll, ll> pll;
- typedef map <int, int> mii;
- typedef pair <int, int> pii;
- typedef map <char, int> mci;
- typedef map <string, int> msi;
- typedef pair <string, int> psi;
- typedef unsigned long long ull;
- typedef map <string, string> mss;
- template<class T>inline T SQ( T a ) { return a * a; }
- template<class T>inline T MAX( T a, T b ) { return a > b ? a : b; }
- template<class T>inline T MIN( T a, T b ) { return a < b ? a : b; }
- template<class T>inline T ABS( T a ) { return a < 0 ? ( a * -1 ) : a; }
- template<class T>inline void SWAP( T &a, T &b ) { a ^= b; b = a ^ b; a ^= b; }
- template<class T>inline T GCD( T a, T b ) { while( b ) { b ^= a ^= b ^= a %= b; } return a; }
- template<class T, class T1>inline void REVS( T1 &A, T i, T j ) { for( ; i < j; i++, j-- ) SWAP( A[i], A[j] ); }
- template<class T, class T1>inline void REVC( T1 A[], T i, T j ) { for( ; i < j; i++, j-- ) SWAP( A[i], A[j] ); }
- const int SZ = 100005;
- const double EPS = 1e-9;
- const int INF = 2147383647;
- const int MOD = 100009;
- const double PI = 2 * acos( 0.0 );
- int main() {
- ios_base::sync_with_stdio( 0 );
- //#define fileIO
- //#define deBug
- //#define cfTest
- #ifdef fileIO
- //read( "input.txt" );
- write( "output.txt" );
- #endif
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement