From 1ccba7112b334c0887bd349966219b38eb9ccfb9 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Sun, 10 Dec 2023 15:55:42 +0200
Subject: Removed some empty problems and solved 2 problems in rust

---
 contests/EduRound145/C/main.cpp | 136 ----------------------------------------
 1 file changed, 136 deletions(-)
 delete mode 100755 contests/EduRound145/C/main.cpp

(limited to 'contests/EduRound145/C/main.cpp')

diff --git a/contests/EduRound145/C/main.cpp b/contests/EduRound145/C/main.cpp
deleted file mode 100755
index 8cfbed2..0000000
--- a/contests/EduRound145/C/main.cpp
+++ /dev/null
@@ -1,136 +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, k;
-  cin >> n >> k;
-  vi a = {1, 2, -3, 4, 5};
-
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
-- 
cgit v1.2.3