aboutsummaryrefslogtreecommitdiff
path: root/contests/Round901/F
diff options
context:
space:
mode:
authoromagdy7 <omar.professional8777@gmail.com>2023-11-01 21:03:55 +0200
committeromagdy7 <omar.professional8777@gmail.com>2023-11-01 21:03:55 +0200
commitd2d5b3b5ca9ae0b13c347ae77f6abd15fdb44390 (patch)
treebe9c76ffe5f8fff598286983d8a9293d0c897c79 /contests/Round901/F
parent1e83036c3ff40310af6cf0d915ad1621d2eeeb83 (diff)
downloadcompetitive-programming-d2d5b3b5ca9ae0b13c347ae77f6abd15fdb44390.tar.xz
competitive-programming-d2d5b3b5ca9ae0b13c347ae77f6abd15fdb44390.zip
Added a debug.h which contains all nesccseary functions to debug my code
Diffstat (limited to 'contests/Round901/F')
-rwxr-xr-xcontests/Round901/F/main.cpp54
1 files changed, 54 insertions, 0 deletions
diff --git a/contests/Round901/F/main.cpp b/contests/Round901/F/main.cpp
new file mode 100755
index 0000000..539fdb0
--- /dev/null
+++ b/contests/Round901/F/main.cpp
@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x) \
+ sort(all((x))); \
+ (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+ ---------------------------
+ * special cases (n=1?)
+ * int overflow, array bounds
+ * do smth instead of nothing and stay organized
+ * WRITE STUFF DOWN
+ * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() { <()> }
+
+int main() {
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ int tt;
+ cin >> tt;
+ while (tt--) {
+ solve();
+ }
+}