aboutsummaryrefslogtreecommitdiff
path: root/contests/Round859(Div4)/B
diff options
context:
space:
mode:
authoromagdy7 <omar.professional8777@gmail.com>2023-07-24 13:11:33 +0300
committeromagdy7 <omar.professional8777@gmail.com>2023-07-24 13:11:33 +0300
commit6b548332bfc6469756526002971c422f43f86d0a (patch)
tree261fde23f07c3e20cea375030f0c52863b59228c /contests/Round859(Div4)/B
parentcff8cae22ee9c25d193ff976143813f93e658e55 (diff)
downloadcompetitive-programming-6b548332bfc6469756526002971c422f43f86d0a.tar.xz
competitive-programming-6b548332bfc6469756526002971c422f43f86d0a.zip
Removed some empty *.cpp files and Solved some new problems
Diffstat (limited to 'contests/Round859(Div4)/B')
-rwxr-xr-xcontests/Round859(Div4)/B/mainbin22328 -> 0 bytes
-rwxr-xr-xcontests/Round859(Div4)/B/main.cpp150
-rw-r--r--contests/Round859(Div4)/B/main_input0.txt7
-rw-r--r--contests/Round859(Div4)/B/main_output0.txt3
4 files changed, 0 insertions, 160 deletions
diff --git a/contests/Round859(Div4)/B/main b/contests/Round859(Div4)/B/main
deleted file mode 100755
index 9c85033..0000000
--- a/contests/Round859(Div4)/B/main
+++ /dev/null
Binary files differ
diff --git a/contests/Round859(Div4)/B/main.cpp b/contests/Round859(Div4)/B/main.cpp
deleted file mode 100755
index 0c93911..0000000
--- a/contests/Round859(Div4)/B/main.cpp
+++ /dev/null
@@ -1,150 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-using ll = long long;
-using pii = pair<int, int>;
-using vpi = vector<pii>;
-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
-#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
-#define ceil(a, b) ((a) + (b) - 1) / (b))
-
-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};
-
-template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p);
-template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec);
-template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m);
-template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m);
-template<typename T> ostream& operator<<(ostream& os, const set<T>& s);
-template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s);
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const pair<K, V>& p) {
- os << "(" << p.first << ", " << p.second << ")";
- return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const vector<T>& vec) {
- os << "{";
- for (size_t i = 0; i < vec.size(); ++i) {
- if (i > 0) os << ", ";
- os << vec[i];
- }
- os << "}";
- return os;
-}
-
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const map<K, V>& m) {
- os << "{";
- for (const auto& p : m) {
- os << p.first << ": " << p.second << ", ";
- }
- os << "}";
- return os;
-}
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const unordered_map<K, V>& m) {
- os << "{";
- for (const auto& p : m) {
- os << p.first << ": " << p.second << ", ";
- }
- os << "}";
- return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const set<T>& s) {
- int i = 0;
- os << "{";
- for (const auto& e : s) {
- if (i > 0) os << ", ";
- os << e;
- i++;
- }
- os << "}";
- return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const unordered_set<T>& s) {
- int i = 0;
- os << "{";
- for (const auto& e : s) {
- if (i > 0) os << ", ";
- os << e;
- i++;
- }
- os << "}";
- return os;
-}
-
-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 n;
- cin >> n;
- vi v(n);
- for (auto &x : v) cin >> x;
- int even = 0;
- int odd = 0;
- for (int i = 0; i < n; i++) {
- if (v[i] & 1) {
- odd += v[i];
- } else {
- even += v[i];
- }
- }
- if (even > odd) {
- cout << "YES\n";
- } else {
- cout << "NO\n";
- }
-
-}
-
-int main () {
- ios_base::sync_with_stdio(false);
- cin.tie(NULL);
- int tt;
- cin >> tt;
- while(tt--) {
- solve();
- }
-}
-
-
diff --git a/contests/Round859(Div4)/B/main_input0.txt b/contests/Round859(Div4)/B/main_input0.txt
deleted file mode 100644
index bdafd50..0000000
--- a/contests/Round859(Div4)/B/main_input0.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-3
-4
-1 2 3 4
-4
-1 1 1 2
-3
-1 4 3
diff --git a/contests/Round859(Div4)/B/main_output0.txt b/contests/Round859(Div4)/B/main_output0.txt
deleted file mode 100644
index c6e03a3..0000000
--- a/contests/Round859(Div4)/B/main_output0.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-YES
-NO
-NO