From 3a89fc707253f75f46fd5a4822817f1fd5156c40 Mon Sep 17 00:00:00 2001
From: Omar Magdy <omar.professional8777@gmail.com>
Date: Mon, 30 May 2022 00:18:17 +0200
Subject: Made that every problem is its own folder to make building the code a
 smooth operation with a shortcut

---
 Odd-EvenIncrements/Odd-EvenIncrements.cpp | 59 +++++++++++++++++++++++++++++++
 1 file changed, 59 insertions(+)
 create mode 100644 Odd-EvenIncrements/Odd-EvenIncrements.cpp

(limited to 'Odd-EvenIncrements')

diff --git a/Odd-EvenIncrements/Odd-EvenIncrements.cpp b/Odd-EvenIncrements/Odd-EvenIncrements.cpp
new file mode 100644
index 0000000..dad00f5
--- /dev/null
+++ b/Odd-EvenIncrements/Odd-EvenIncrements.cpp
@@ -0,0 +1,59 @@
+#include<bits/stdc++.h>
+using namespace std;
+bool isEvenOrOdd(vector<int> v) {
+  bool even = false;
+  bool odd = false;
+  for(int x : v) {
+    if(x % 2 != 0) {
+      even = false;
+      break;
+    }
+    else{
+      even = true;
+    }
+  }
+  for(int x : v) {
+    if(x % 2 == 0) {
+      odd = false;
+      break;
+    }
+    else{
+      odd = true;
+    }
+  }
+  return odd || even;
+}
+
+int main() {
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    int n;
+    cin >> n;
+    vector<int> v(n);
+    vector<int> vEven;
+    vector<int> vOdd;
+    for(int &x : v) {
+      cin >> x;
+    }
+    bool ok = isEvenOrOdd(v);
+    for(int x : v) {
+      vEven.push_back(x);
+      vOdd.push_back(x);
+    }
+    for(int i = 0; i < v.size(); i++) {
+      if(i % 2 == 0){
+        vEven[i]++;
+      }
+    }
+    bool evenOp = isEvenOrOdd(vEven);
+    for(int i = 0; i < v.size(); i++) {
+      if(i % 2 != 0){
+        vOdd[i]++;
+      }
+    }
+    bool oddOp = isEvenOrOdd(vOdd);
+    cout << (ok ? "YES" : (evenOp || oddOp ? "YES" : "NO")) << endl;
+
+  }
+}
-- 
cgit v1.2.3