aboutsummaryrefslogtreecommitdiff
path: root/contests/Starters79/D/main.cpp
diff options
context:
space:
mode:
authoromagdy7 <omar.professional8777@gmail.com>2023-03-05 20:04:34 +0200
committeromagdy7 <omar.professional8777@gmail.com>2023-03-05 20:04:34 +0200
commit90c03b3c6301f5d8908ce3e2dec936a74b035014 (patch)
treee15816a4615f5e03650bf1be41c6867992919987 /contests/Starters79/D/main.cpp
parentef9dfb5d8bfa705a0c056a2652d298e5ebb763fb (diff)
downloadcompetitive-programming-90c03b3c6301f5d8908ce3e2dec936a74b035014.tar.xz
competitive-programming-90c03b3c6301f5d8908ce3e2dec936a74b035014.zip
Solved a bunch of problems
Diffstat (limited to 'contests/Starters79/D/main.cpp')
-rwxr-xr-xcontests/Starters79/D/main.cpp102
1 files changed, 102 insertions, 0 deletions
diff --git a/contests/Starters79/D/main.cpp b/contests/Starters79/D/main.cpp
new file mode 100755
index 0000000..5eaae94
--- /dev/null
+++ b/contests/Starters79/D/main.cpp
@@ -0,0 +1,102 @@
+#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 x, y;
+ cin >> x >> y;
+ if (x - y >= 2) {
+ cout << "CHEF" << '\n';
+ } else if (y - x >= 2) {
+ cout << "CHEFINA" << '\n';
+ } else if (x == y) {
+ if (x % 2 == 0) {
+ cout << "CHEFINA" << '\n';
+ } else {
+ cout << "CHEF" << '\n';
+ }
+ } else {
+ if (x > y and x % 2 == 1 and y % 2 == 0) {
+ cout << "CHEFINA" << '\n';
+ } else if (x < y && x % 2 == 1 && y % 2 == 0) {
+ cout << "CHEF" << '\n';
+ } else if (x > y && x % 2 == 0 && y % 2 == 1) {
+ cout << "CHEF" << '\n';
+ } else if (x < y && x % 2 == 0 && y % 2 == 1) {
+ cout << "CHEFINA" << '\n';
+ }
+ }
+}
+
+int main() {
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ int tt;
+ cin >> tt;
+ while (tt--) {
+ solve();
+ }
+}