Advertisement
Guest User

mahmud

a guest
Nov 28th, 2014
146
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.38 KB | None | 0 0
  1. #include <set>
  2. #include <map>
  3. #include <list>
  4. #include <cmath>
  5. #include <ctime>
  6. #include <deque>
  7. #include <queue>
  8. #include <stack>
  9. #include <cctype>
  10. #include <cstdio>
  11. #include <string>
  12. #include <vector>
  13. #include <cassert>
  14. #include <cstdlib>
  15. #include <cstring>
  16. #include <sstream>
  17. #include <iostream>
  18. #include <algorithm>
  19.  
  20. #define fst first
  21. #define scd second
  22. #define pb push_back
  23. #define psp() printf( " " )
  24. #define pnl() printf( "\n" )
  25. #define sq( x ) ( (x) * (x) )
  26. #define phl() printf( "Hello World!!!" )
  27. #define pcase( x ) printf( "Case %d:", (x) )
  28. #define read( in ) freopen( (in), "r", stdin )
  29. #define write( out ) freopen( (out), "w", stdout )
  30. #define rep( i, a, b ) for( (i) = (a); (i) <= (b); (i)++ )
  31. #define rev( i, a, b ) for( (i) = (a); (i) >= (b); (i)-- )
  32. #define mems( arr, val ) memset( (arr), (val), sizeof( (arr) ) )
  33.  
  34. #define dp1( x ) cout << (x) << endl
  35. #define dp2( x, y ) cout << (x) << " " << (y) << endl
  36. #define dp3( x, y, z ) cout << (x) << " " << (y) << " " << (z) << endl
  37.  
  38. using namespace std;
  39.  
  40. typedef long long ll;
  41. typedef set <int> si;
  42. typedef queue <int> qi;
  43. typedef vector <int> vi;
  44. typedef pair <ll, ll> pll;
  45. typedef map <int, int> mii;
  46. typedef pair <int, int> pii;
  47. typedef map <char, int> mci;
  48. typedef map <string, int> msi;
  49. typedef pair <string, int> psi;
  50. typedef unsigned long long ull;
  51. typedef map <string, string> mss;
  52.  
  53. template<class T>inline T SQ( T a ) { return a * a; }
  54. template<class T>inline T MAX( T a, T b ) { return a > b ? a : b; }
  55. template<class T>inline T MIN( T a, T b ) { return a < b ? a : b; }
  56. template<class T>inline T ABS( T a ) { return a < 0 ? ( a * -1 ) : a; }
  57. template<class T>inline void SWAP( T &a, T &b ) { a ^= b; b = a ^ b; a ^= b; }
  58. template<class T>inline T GCD( T a, T b ) { while( b ) { b ^= a ^= b ^= a %= b; } return a; }
  59. template<class T, class T1>inline void REVS( T1 &A, T i, T j ) { for( ; i < j; i++, j-- ) SWAP( A[i], A[j] ); }
  60. template<class T, class T1>inline void REVC( T1 A[], T i, T j ) { for( ; i < j; i++, j-- ) SWAP( A[i], A[j] ); }
  61.  
  62. const int SZ = 100005;
  63. const double EPS = 1e-9;
  64. const int INF = 2147383647;
  65. const int MOD = 100009;
  66. const double PI = 2 * acos( 0.0 );
  67.  
  68. int main() {
  69. ios_base::sync_with_stdio( 0 );
  70. //#define fileIO
  71. //#define deBug
  72. //#define cfTest
  73. #ifdef fileIO
  74. //read( "input.txt" );
  75. write( "output.txt" );
  76. #endif
  77.  
  78. return 0;
  79. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement