summaryrefslogtreecommitdiff
path: root/2022/Day1
diff options
context:
space:
mode:
authoromagdy7 <omar.professional8777@gmail.com>2022-12-03 14:02:00 +0200
committeromagdy7 <omar.professional8777@gmail.com>2022-12-03 14:02:00 +0200
commitfc7d21b046fe47f8cb109677866f2c78a6140ffe (patch)
tree12caa883f2e1a0925753e4b6af6dc1fbf1923985 /2022/Day1
parenta35770af4761d621110fc00546990144cdb740e8 (diff)
downloadaoc-fc7d21b046fe47f8cb109677866f2c78a6140ffe.tar.xz
aoc-fc7d21b046fe47f8cb109677866f2c78a6140ffe.zip
Removed uncessary code used for debugging
Diffstat (limited to '2022/Day1')
-rw-r--r--2022/Day1/main.cpp64
1 files changed, 0 insertions, 64 deletions
diff --git a/2022/Day1/main.cpp b/2022/Day1/main.cpp
index 40045a3..6f9f848 100644
--- a/2022/Day1/main.cpp
+++ b/2022/Day1/main.cpp
@@ -2,75 +2,11 @@
using namespace std;
using ll = long long;
-using pi = pair<int, int>;
-using vpi = vector<pi>;
-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
-
-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() {
string s;