Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define int long long
- #define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
- //#include <ext/pb_ds/assoc_container.hpp>
- //using namespace __gnu_pbds;
- //typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
- std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());
- const int INF = 1e18 + 7;
- const double EPS = 1e-10;
- const int MOD = 1e9 + 7;
- const int MAXN = 5e4 + 100;
- inline void solve() {
- }
- int32_t main() {
- IOS;
- clock_t tStart = clock();
- int tt = 1;
- // cin >> tt;
- while (tt --> 0) {
- solve();
- }
- // cerr << "Runtime is:" << (long double) (clock() - tStart) / CLOCKS_PER_SEC << '\n';
- return 0;
- }
- //████──█──█──███──████──███──█──█──█──█──███──█──█
- //█──█──██─█───█───█──█──█────█──█──█─█────█───██─█
- //████──█─██───█───█──█──███──████──██─────█───█─██
- //█──█──█──█───█───█──█────█──█──█──█─█────█───█──█
- //█──█──█──█───█───████──███──█──█──█──█──███──█──█
Advertisement
Add Comment
Please, Sign In to add comment