aboutsummaryrefslogtreecommitdiff
path: root/contests/Round#835/A/main.cpp
diff options
context:
space:
mode:
authoromagdy7 <omar.professional8777@gmail.com>2022-11-25 16:03:32 +0200
committeromagdy7 <omar.professional8777@gmail.com>2022-11-25 16:03:32 +0200
commit3728c124ca1488a113cf76c8efcd5d815327a437 (patch)
tree47938b3c31980eb891be90c00f313a360b2ab333 /contests/Round#835/A/main.cpp
parent66d5d77247012cbcd65ef6e8294bdb042198a5c2 (diff)
downloadcompetitive-programming-3728c124ca1488a113cf76c8efcd5d815327a437.tar.xz
competitive-programming-3728c124ca1488a113cf76c8efcd5d815327a437.zip
Added some new problems
Diffstat (limited to 'contests/Round#835/A/main.cpp')
-rw-r--r--contests/Round#835/A/main.cpp53
1 files changed, 53 insertions, 0 deletions
diff --git a/contests/Round#835/A/main.cpp b/contests/Round#835/A/main.cpp
new file mode 100644
index 0000000..5cff2f4
--- /dev/null
+++ b/contests/Round#835/A/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};
+
+int solve() {
+ vi v(3);
+ for (auto &x : v) cin >> x;
+ for (auto x : v) {
+ if (x != *min_element(all(v)) && x != *max_element(all(v))) {
+ return x;
+ }
+ }
+ return 1;
+}
+
+int main () {
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ int tt;
+ cin >> tt;
+ while(tt--) {
+ cout << solve() << '\n';
+ }
+}
+
+/* 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
+ */