From 66d5d77247012cbcd65ef6e8294bdb042198a5c2 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Mon, 14 Nov 2022 23:48:43 +0200
Subject: Moved two files into codeforces directory

---
 codeforces/TheUltimateSquare/main             | Bin 0 -> 22704 bytes
 codeforces/TheUltimateSquare/main.cpp         |  53 ++++++++++++++++++++++++++
 codeforces/TheUltimateSquare/main_input0.txt  |   4 ++
 codeforces/TheUltimateSquare/main_output0.txt |   3 ++
 4 files changed, 60 insertions(+)
 create mode 100755 codeforces/TheUltimateSquare/main
 create mode 100644 codeforces/TheUltimateSquare/main.cpp
 create mode 100644 codeforces/TheUltimateSquare/main_input0.txt
 create mode 100644 codeforces/TheUltimateSquare/main_output0.txt

(limited to 'codeforces/TheUltimateSquare')

diff --git a/codeforces/TheUltimateSquare/main b/codeforces/TheUltimateSquare/main
new file mode 100755
index 0000000..81afd64
Binary files /dev/null and b/codeforces/TheUltimateSquare/main differ
diff --git a/codeforces/TheUltimateSquare/main.cpp b/codeforces/TheUltimateSquare/main.cpp
new file mode 100644
index 0000000..102880d
--- /dev/null
+++ b/codeforces/TheUltimateSquare/main.cpp
@@ -0,0 +1,53 @@
+#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 push_back pb
+#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};
+
+void solve() {
+  int n;
+  cin >> n;
+  if (n & 1) {
+    cout << (n / 2) + 1 << '\n';
+  } else {
+    cout << n / 2 << '\n';
+  }
+
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int tt;
+	cin >> tt;
+	while(tt--) {
+    solve();
+	}
+}
+
+/* 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
+ */
diff --git a/codeforces/TheUltimateSquare/main_input0.txt b/codeforces/TheUltimateSquare/main_input0.txt
new file mode 100644
index 0000000..650d174
--- /dev/null
+++ b/codeforces/TheUltimateSquare/main_input0.txt
@@ -0,0 +1,4 @@
+3
+2
+5
+197654321
diff --git a/codeforces/TheUltimateSquare/main_output0.txt b/codeforces/TheUltimateSquare/main_output0.txt
new file mode 100644
index 0000000..773b55e
--- /dev/null
+++ b/codeforces/TheUltimateSquare/main_output0.txt
@@ -0,0 +1,3 @@
+1
+3
+98827161
-- 
cgit v1.2.3