aboutsummaryrefslogtreecommitdiff
path: root/EvenAndOdd/EvenAndOdd.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /EvenAndOdd/EvenAndOdd.cpp
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'EvenAndOdd/EvenAndOdd.cpp')
-rw-r--r--EvenAndOdd/EvenAndOdd.cpp25
1 files changed, 25 insertions, 0 deletions
diff --git a/EvenAndOdd/EvenAndOdd.cpp b/EvenAndOdd/EvenAndOdd.cpp
new file mode 100644
index 0000000..3699c1b
--- /dev/null
+++ b/EvenAndOdd/EvenAndOdd.cpp
@@ -0,0 +1,25 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+ int tt; cin >>tt;
+ while(tt--){
+ bool even = true, odd = true;
+ int n;
+ cin >> n;
+ vector<int> v(n);
+ for(int &x : v) cin >> x;
+ for(int i : v) {
+ if(i % 2 != 0) {
+ even = false;
+ }
+ }
+ for(int i : v) {
+ if(i % 2 == 0) {
+ odd = false;
+ }
+ }
+ cout << (!even && !odd ? "Mix" : even ? "Even" : "Odd") << endl;
+ }
+}