From 6b548332bfc6469756526002971c422f43f86d0a Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Mon, 24 Jul 2023 13:11:33 +0300
Subject: Removed some empty *.cpp files and Solved some new problems

---
 contests/NeviusWelcomeRound(div1+div2)/A/main     | Bin 17928 -> 16816 bytes
 contests/NeviusWelcomeRound(div1+div2)/A/main.cpp |  30 +++----
 contests/NeviusWelcomeRound(div1+div2)/C/main.cpp |  91 ----------------------
 contests/NeviusWelcomeRound(div1+div2)/D/main.cpp |  91 ----------------------
 contests/NeviusWelcomeRound(div1+div2)/E/main.cpp |  91 ----------------------
 contests/NeviusWelcomeRound(div1+div2)/F/main.cpp |  91 ----------------------
 6 files changed, 10 insertions(+), 384 deletions(-)
 delete mode 100755 contests/NeviusWelcomeRound(div1+div2)/C/main.cpp
 delete mode 100755 contests/NeviusWelcomeRound(div1+div2)/D/main.cpp
 delete mode 100755 contests/NeviusWelcomeRound(div1+div2)/E/main.cpp
 delete mode 100755 contests/NeviusWelcomeRound(div1+div2)/F/main.cpp

(limited to 'contests/NeviusWelcomeRound(div1+div2)')

diff --git a/contests/NeviusWelcomeRound(div1+div2)/A/main b/contests/NeviusWelcomeRound(div1+div2)/A/main
index 2ab498b..cfc4c85 100755
Binary files a/contests/NeviusWelcomeRound(div1+div2)/A/main and b/contests/NeviusWelcomeRound(div1+div2)/A/main differ
diff --git a/contests/NeviusWelcomeRound(div1+div2)/A/main.cpp b/contests/NeviusWelcomeRound(div1+div2)/A/main.cpp
index a54c436..6b3dda0 100755
--- a/contests/NeviusWelcomeRound(div1+div2)/A/main.cpp
+++ b/contests/NeviusWelcomeRound(div1+div2)/A/main.cpp
@@ -1,4 +1,4 @@
-#include<bits/stdc++.h>
+#include <bits/stdc++.h>
 using namespace std;
 
 using ll = long long;
@@ -10,7 +10,7 @@ using mpii = map<int, int>;
 using mpll = map<ll, ll>;
 using db = long double;
 
-#define pb push_back 
+#define pb push_back
 #define all(x) (x).begin(), (x).end()
 #define rall(x) (x).rbegin(), (x).rend()
 #define lb lower_bound
@@ -23,17 +23,15 @@ 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) {
+// 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) {
+template <typename T> void printv(const vector<T> &v) {
   cerr << "[";
   for (int i = 0; i < v.size(); i++) {
     if (i == v.size() - 1) {
@@ -45,8 +43,7 @@ void printv(const vector<T> &v) {
   cerr << "]\n";
 }
 
-template<typename T>
-void printvv(const vector<vector<T>> &v) {
+template <typename T> void printvv(const vector<vector<T>> &v) {
   cerr << "[\n";
   for (auto &vec : v) {
     cout << "  ";
@@ -54,17 +51,13 @@ void printvv(const vector<vector<T>> &v) {
   }
   cerr << "]\n";
 }
-void print() {
-  cerr << "\n";
-}
+void print() { cerr << "\n"; }
 
-template<typename T, typename... TS>
-void print(T val, TS... vals) {
+template <typename T, typename... TS> void print(T val, TS... vals) {
   cerr << val << " ";
   print(vals...);
 }
 
-
 /* stuff you should look for:
   ---------------------------
    * special cases (n=1?)
@@ -90,17 +83,14 @@ void solve() {
   } else {
     cout << abs(a) * 2 << '\n';
   }
-
 }
 
-int main () {
+int main() {
   ios_base::sync_with_stdio(false);
   cin.tie(NULL);
   int tt;
   cin >> tt;
-  while(tt--) {
+  while (tt--) {
     solve();
   }
 }
-
-
diff --git a/contests/NeviusWelcomeRound(div1+div2)/C/main.cpp b/contests/NeviusWelcomeRound(div1+div2)/C/main.cpp
deleted file mode 100755
index 9af49f8..0000000
--- a/contests/NeviusWelcomeRound(div1+div2)/C/main.cpp
+++ /dev/null
@@ -1,91 +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 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};
-
-//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 main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/NeviusWelcomeRound(div1+div2)/D/main.cpp b/contests/NeviusWelcomeRound(div1+div2)/D/main.cpp
deleted file mode 100755
index 9af49f8..0000000
--- a/contests/NeviusWelcomeRound(div1+div2)/D/main.cpp
+++ /dev/null
@@ -1,91 +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 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};
-
-//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 main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/NeviusWelcomeRound(div1+div2)/E/main.cpp b/contests/NeviusWelcomeRound(div1+div2)/E/main.cpp
deleted file mode 100755
index 9af49f8..0000000
--- a/contests/NeviusWelcomeRound(div1+div2)/E/main.cpp
+++ /dev/null
@@ -1,91 +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 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};
-
-//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 main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/NeviusWelcomeRound(div1+div2)/F/main.cpp b/contests/NeviusWelcomeRound(div1+div2)/F/main.cpp
deleted file mode 100755
index 9af49f8..0000000
--- a/contests/NeviusWelcomeRound(div1+div2)/F/main.cpp
+++ /dev/null
@@ -1,91 +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 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};
-
-//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 main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
-- 
cgit v1.2.3