tranxuanbach

sinh nick group (domain users)

Oct 21st, 2020 (edited)
719
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. //#define BITSET64BIT 1
  2. #ifdef BITSET64BIT
  3. #include <string>
  4. #include <bits/functexcept.h>
  5. #include <iosfwd>
  6. #include <bits/cxxabi_forced.h>
  7. #include <bits/functional_hash.h>
  8.  
  9. #pragma push_macro("__SIZEOF_LONG__")
  10. #pragma push_macro("__cplusplus")
  11. #define __SIZEOF_LONG__ __SIZEOF_LONG_LONG__
  12. #define unsigned unsigned long
  13. #define __cplusplus 201102L
  14.  
  15. #define __builtin_popcountl __builtin_popcountll
  16. #define __builtin_ctzl __builtin_ctzll
  17.  
  18. #include <bitset>
  19.  
  20. #pragma pop_macro("__cplusplus")
  21. #pragma pop_macro("__SIZEOF_LONG__")
  22. #undef unsigned
  23. #undef __builtin_popcountl
  24. #undef __builtin_ctzl
  25. #endif
  26.  
  27. #include <bits/stdc++.h>
  28. #include <ext/pb_ds/assoc_container.hpp>
  29. #include <ext/pb_ds/tree_policy.hpp>
  30. using namespace std;
  31. using namespace __gnu_pbds;
  32.  
  33. // Optimization
  34.  
  35. /*
  36. #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
  37. #pragma GCC target("avx,avx2,fma")
  38. #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  39. #pragma comment(linker,"/stack:200000000")
  40. */
  41. #define endl '\n'
  42.  
  43. // Shortcut
  44.  
  45. #define int long long
  46. #define eb emplace_back
  47. #define pb push_back
  48. #define pob pop_back
  49. #define upb upper_bound
  50. #define lwb lower_bound
  51. #define fi first
  52. #define se second
  53. #define For(i, l, r) for (int i = l; i < r; i++)
  54. #define ForE(i, l, r) for (int i = l; i <= r; i++)
  55. #define Ford(i, r, l) for (int i = r; i > l; i--)
  56. #define FordE(i, r, l) for (int i = r; i >= l; i--)
  57. #define Fora(i, a) for (auto i : a)
  58.  
  59. // I/O & Debug
  60.  
  61. #define PrintV(a) Fora(h13, a) cout << h13 << ' '; cout << endl;
  62. #define PrintVl(a) Fora(h13, a) cout << h13 << endl;
  63. #define PrintA(a, l, r) for (int h13 = l; h13 <= r; h13++) cout << a[h13] << ' '; cout << endl;
  64. #define PrintAl(a, l, r) for (int h13 = l; h13 <= r; h13++) cout << a[h13] << endl;
  65. #define Ptest(x) return cout << x, 0;
  66. #define getl(s) getline(cin, s);
  67. #define setpre(x) fixed << setprecision(x)
  68. /*
  69. #define debug(args...){                                                                     \\
  70.     string _sDEB = #args;                                                                   \\
  71.     replace(_sDEB.begin(), _sDEB.end(), ',', ' ');                                          \\
  72.     stringstream _ssDEB(_sDEB);                                                             \\
  73.     istream_iterator<string> _itDEB(_ssDEB);                                                \\
  74.     DEB(_itDEB, args);                                                                      \\
  75. }
  76. void DEB(istream_iterator<string> it) {}
  77. template<typename T, typename... Args>
  78. void DEB(istream_iterator<string> it, T a, Args... args){
  79.     cout << *it << " = " << a << endl;
  80.     DEB(++it, args...);
  81. }
  82. */
  83.  
  84. // Functions
  85.  
  86. #define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u' || a == 'y')
  87. #define bend(a) a.begin(), a.end()
  88. #define rbend(a) a.rbegin(), a.rend()
  89. #define mset(a) memset(a, 0, sizeof(a))
  90. #define mset1(a) memset(a, 1, sizeof(a))
  91. #define msetn1(a) memset(a, -1, sizeof(a))
  92. #define msetinf(a) memset(a, 0x3f, sizeof(a))
  93. #define gcd __gcd
  94. #define __builtin_popcount __builtin_popcountll
  95. #define randt(l, r) (rando() % (r - l + 1) + l)
  96.  
  97. // Data Structure
  98.  
  99. // Policy based data structures                                                             \\
  100.    Support find_by_order(int k): return an iterator to the k-th smallest element,           \\
  101.                                  counting from 0                                            \\
  102.            order_of_key(int k): return the number of items strictly smaller than k          \\
  103.    For ordered_multiset and ordered_multimap, lower_bound() and upper_bound() are swapped
  104.  
  105. template <typename T> using ordered_set =
  106. tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
  107. template <typename Key, typename T> using ordered_map =
  108. tree <Key, T, less <Key>, rb_tree_tag, tree_order_statistics_node_update>;
  109. template <typename T> using ordered_multiset =
  110. tree <T, null_type, less_equal <T>, rb_tree_tag, tree_order_statistics_node_update>;
  111. template <typename Key, typename T> using ordered_multimap =
  112. tree <Key, T, less_equal <Key>, rb_tree_tag, tree_order_statistics_node_update>;
  113.  
  114. #define y0 _y0_
  115. #define y1 _y1_
  116. #define div divi
  117. typedef long long ll;
  118. typedef long double ld;
  119. typedef vector <int> vi;
  120. typedef vector <ll> vll;
  121. typedef vector <ld> vld;
  122. typedef vector <string> vs;
  123. typedef pair <int, int> pii;
  124. typedef pair <ll, ll> pll;
  125. typedef vector <vi > vvi;
  126. typedef vector <vll > vvll;
  127. typedef vector <pii > vpii;
  128. typedef vector <pll > vpll;
  129.  
  130. const int N = 1e2 + 5, K = 1e5 + 5;
  131. int mod = 1e9 + 7, mod1 = 998244353, mod2 = 1e9 + 9, inf = 1e9 + 7;
  132. ll infll = 1e18 + 7;
  133.  
  134. string tos(int x){
  135.     string ans;
  136.     ans += x / 10 + '0';
  137.     ans += x % 10 + '0';
  138.     return ans;
  139. }
  140.  
  141. string vowels = "aeiouy";
  142. string consonants = "bcdfghjklmnpqrstvwxz";
  143.  
  144. signed main(){
  145.     ios_base::sync_with_stdio(0);
  146.     cin.tie(0); cout.tie(0);
  147. int seed; cin >> seed;
  148. mt19937_64 rando(seed);
  149. int nicks = 30;
  150. ForE(i, 1, nicks){
  151.     string pass;
  152.     For(i, 0, 8){
  153.         if (i % 2){
  154.             pass += vowels[randt(0, vowels.length() - 1)];
  155.         }
  156.         else{
  157.             pass += consonants[randt(0, consonants.length() - 1)];
  158.         }
  159.     }
  160.     cout << "300213" << " | "
  161.          << "chd2020_" << tos(i) << " | "
  162.          << pass << " | "
  163.          << "CHD2020 TEAM " << tos(i) << endl;
  164. }
  165. }
  166.  
  167. /*
  168. ==================================+
  169. INPUT:                            |
  170. ------------------------------    |
  171.  
  172. ------------------------------    |
  173. ==================================+
  174. OUTPUT:                           |
  175. ------------------------------    |
  176.  
  177. ------------------------------    |
  178. ==================================+
  179. */
RAW Paste Data