From 115f46e93398fea52915071eff859a5a2fa11b06 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Mon, 28 Nov 2022 19:02:12 +0200
Subject: Solved 5 more problems

---
 codeforces/PhoenixAndBalance/main             | Bin 0 -> 27488 bytes
 codeforces/PhoenixAndBalance/main.cpp         | 108 ++++++++++++++++++++++++++
 codeforces/PhoenixAndBalance/main_input0.txt  |   3 +
 codeforces/PhoenixAndBalance/main_output0.txt |   2 +
 4 files changed, 113 insertions(+)
 create mode 100755 codeforces/PhoenixAndBalance/main
 create mode 100644 codeforces/PhoenixAndBalance/main.cpp
 create mode 100644 codeforces/PhoenixAndBalance/main_input0.txt
 create mode 100644 codeforces/PhoenixAndBalance/main_output0.txt

(limited to 'codeforces/PhoenixAndBalance')

diff --git a/codeforces/PhoenixAndBalance/main b/codeforces/PhoenixAndBalance/main
new file mode 100755
index 0000000..09351ca
Binary files /dev/null and b/codeforces/PhoenixAndBalance/main differ
diff --git a/codeforces/PhoenixAndBalance/main.cpp b/codeforces/PhoenixAndBalance/main.cpp
new file mode 100644
index 0000000..be824f3
--- /dev/null
+++ b/codeforces/PhoenixAndBalance/main.cpp
@@ -0,0 +1,108 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+void print() {
+  cerr << "\n";
+}
+
+template<typename T, typename... TS>
+void print(T val, TS... vals) {
+  cerr << val << " ";
+  print(vals...);
+}
+
+
+/* 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 n;
+  cin >> n;
+  vi v(n);
+  for (int i = 1; i < n + 1; i++) {
+    v[i - 1] = pow(2, i);
+  }
+  if (n > 2) {
+    int sum1 = v[n - 1];
+    int sum2 = 0;
+    for (int i = 0; i < (n / 2) - 1; i++) {
+      sum1 += v[i];
+    }
+    for (int i = (n / 2) - 1; i < n - 1; i++) {
+      sum2 += v[i];
+    }
+    cout << abs(sum1 - sum2) << '\n';
+  } else {
+    cout << 2 << '\n';
+  }
+
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int tt;
+	cin >> tt;
+	while(tt--) {
+    solve();
+	}
+}
+
+
diff --git a/codeforces/PhoenixAndBalance/main_input0.txt b/codeforces/PhoenixAndBalance/main_input0.txt
new file mode 100644
index 0000000..b0f38d1
--- /dev/null
+++ b/codeforces/PhoenixAndBalance/main_input0.txt
@@ -0,0 +1,3 @@
+2
+2
+4
diff --git a/codeforces/PhoenixAndBalance/main_output0.txt b/codeforces/PhoenixAndBalance/main_output0.txt
new file mode 100644
index 0000000..2b24e31
--- /dev/null
+++ b/codeforces/PhoenixAndBalance/main_output0.txt
@@ -0,0 +1,2 @@
+2
+6
-- 
cgit v1.2.3