fork download
copy 
  1. //#pragma GCC optimize("O3,unroll-loops")
  2. //#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
  3.  
  4. #include <bits/stdc++.h>
  5. using namespace std;
  6.  
  7. //#define int ll
  8. #define endl '\n'
  9. #define unoset unordered_set
  10. #define unomap unordered_map
  11. #define strstr stringstream
  12. #define SZ(a) (int)a.size()
  13. #define Unique(a) a.resize(unique(all(a)) - a.begin())
  14. #define fi first
  15. #define se second
  16. #define lb lower_bound
  17. #define ub upper_bound
  18. #define all(s) s.begin(), s.end()
  19. #define rall(s) s.rbegin(), s.rend()
  20. #define rev reverse
  21. #define gcd __gcd
  22. #define pushb push_back
  23. #define popb pop_back
  24. #define pushf push_front
  25. #define popf pop_front
  26. #define emp emplace
  27. #define empb emplace_back
  28. #define empf emplace_front
  29. #define lcm(a, b) (a / __gcd(a, b) * b)
  30. #define log_base(x, base) log(x) / log(base)
  31. #define debug cerr<<"No errors!",exit(0);
  32. #define forw(i, a, b)  for (int i = a; i <= b; ++i)
  33. #define forw2(i, a, b) for (ll i = a; i <= b; ++i)
  34. #define fors(i, a, b)  for (int i = a; i >= b; --i)
  35. #define fors2(i, a, b) for (ll i = a; i >= b; --i)
  36. #define pqueue priority_queue
  37. #define sqrt sqrtl
  38. #define i128 __int128
  39. #define popcount __builtin_popcountll
  40. #define BIT(x, i) (((x) >> (i)) & 1)
  41. #define MASK(x) ((1LL) << (x))
  42. #define want_digit(x) cout << fixed << setprecision(x);
  43. #define excuting_time 1000.0 * clock() / CLOCKS_PER_SEC
  44. #define mapa make_pair
  45. #define ms(a, x) memset(a, x, sizeof(a))
  46.  
  47. typedef long long ll;
  48. typedef unsigned long long ull;
  49. typedef long double ldb;
  50. typedef double db;
  51. typedef string str;
  52. typedef pair<int, int> pii;
  53. typedef pair<ll, ll> pll;
  54.  
  55. const int MOD = 1e9 + 7; // 998244353
  56. const int inf = 1e9;
  57. const ll INF = 1e18; // MASK(63) - 1
  58. const int limN = 1e5 + 5;
  59.  
  60. mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  61. inline ll random(const ll &L, const ll &R) {
  62.     return uniform_int_distribution<ll> (L, R) (rng);
  63. }
  64.  
  65. /* -------~~~~~~===== END OF TEMPLATE =====~~~~~~------- */
  66.  
  67. void solve() {
  68.  
  69. }
  70.  
  71. signed main() {
  72.     ios::sync_with_stdio(false), cin.tie(nullptr);
  73.     #define name "test"
  74.     if (fopen(name".INP", "r")) {
  75.         freopen(name".INP", "r", stdin);
  76.         freopen(name".OUT", "w", stdout);
  77.     }
  78.     bool testCase = false;
  79.     int numTest = 1;
  80.     // cin >> numTest;
  81.     forw (i, 1, numTest) {
  82.         if (testCase) cout << "Case #" << i << ": ";
  83.         solve();
  84.     }
  85.     return 0;
  86. }
  87.  
  88. /*
  89. ≽(•⩊ •マ≼
  90. Ɲyαɦ~!
  91. */
  92.  
  93.  
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/YqdJTk
language:
C++14 (gcc 8.3)
created:
3 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!