Added advent of code

Author: rishabhdeepsingh

Cpp/archive/AdventOfCode2020/AOC2b.cpp

@@ -0,0 +1,68 @@
+// doot diddly donger cuckerino Hahahahahah
+
+
+#pragma GCC optimize("Ofast")
+#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
+#pragma GCC optimize("unroll-loops")
+
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using ld = long double;
+using pii = pair<int, int>;
+using vi = vector<int>;
+
+#define all(x)  (x).begin(), (x).end()
+const ld PI = acos(-1);
+
+template <typename T> inline T mini(T& x, T y) { return x = min(x, y); }
+template <typename T> inline T maxi(T& x, T y) { return x = max(x, y); }
+mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
+template <typename T, typename U>
+std::ostream& operator<<(std::ostream& stream, const pair<T, U>& p) {
+  return stream << p.first << " " << p.second;
+}
+template <typename T>
+std::ostream& operator<<(std::ostream& out, const vector<T>& vec) {
+  for (const T& x: vec) out << x << ' ';
+  return out;
+}
+template <typename T>
+std::istream& operator>>(std::istream& in, vector<T>& vec) {
+  for (auto& x: vec) in >> x;
+  return in;
+}
+
+class AOC2b {
+public:
+  
+  const int SUM = 2020;
+  void solve(std::istream& cin, std::ostream& cout) {
+    vector<int> a;
+    int temp;
+    while (cin >> temp) {
+      a.push_back(temp);
+    }
+    sort(a.begin(), a.end());
+    int n = a.size();
+    for (int i = 0; i < n; ++i) {
+      for (int j = i + 1; j < n; ++j) {
+        if (binary_search(a.begin() + j + 1, a.end(), SUM - a[i] - a[j])) {
+          cout << (a[i] * a[j] * (SUM - a[i] - a[j])) << '\n';
+        }
+      }
+    }
+  }
+};
+
+int32_t main() {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+	AOC2b solver;
+	std::istream& in(std::cin);
+	std::ostream& out(std::cout);
+	solver.solve(in, out);
+	return 0;
+}

Cpp/archive/AdventOfCode2020/AOC3.cpp

@@ -0,0 +1,52 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using ld = long double;
+
+template<typename T> inline T mini(T& x, T y) { return x = min(x, y); }
+template<typename T> inline T maxi(T& x, T y) { return x = max(x, y); }
+template <typename T> T rand(T x, T y) { return rand() % (y - x + 1) + x; }
+mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
+
+
+class AOC3 {
+public:
+  vector<string> a;
+  int n, m;
+  
+  int Count(int x, int y) {
+    int cnt = 0;
+    for (int i = 0, j = 0; i < n; i += y, j = (j + x) % m) {
+      cnt += a[i][j] == '#';
+    }
+    return cnt;
+  }
+  
+  void solve(std::istream& cin, std::ostream& cout) {
+    
+    string temp;
+    while (cin >> temp) {
+      a.push_back(temp);
+    }
+    n = a.size(), m = a[0].size();
+    long long pro = 1;
+    for (auto[x, y]: {make_pair(1, 1), {3, 1}, {5, 1}, {7, 1}, {1, 2}}) {
+      pro *= Count(x, y);
+//      cout << make_pair(x, y) << " " << Count(x, y) << '\n';
+    }
+    cout << pro << '\n';
+  }
+};
+
+int32_t main() {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+	AOC3 solver;
+	std::istream& in(std::cin);
+	std::ostream& out(std::cout);
+	solver.solve(in, out);
+	return 0;
+}

Cpp/archive/AdventOfCode2020/AdventOfCode1.cpp

@@ -0,0 +1,67 @@
+// doot diddly donger cuckerino Hahahahahah
+
+
+#pragma GCC optimize("Ofast")
+#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
+#pragma GCC optimize("unroll-loops")
+
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using ld = long double;
+using pii = pair<int, int>;
+using vi = vector<int>;
+
+#define all(x)  (x).begin(), (x).end()
+const ld PI = acos(-1);
+
+template <typename T> inline T mini(T& x, T y) { return x = min(x, y); }
+template <typename T> inline T maxi(T& x, T y) { return x = max(x, y); }
+mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
+template <typename T, typename U>
+std::ostream& operator<<(std::ostream& stream, const pair<T, U>& p) {
+  return stream << p.first << " " << p.second;
+}
+template <typename T>
+std::ostream& operator<<(std::ostream& out, const vector<T>& vec) {
+  for (const T& x: vec) out << x << ' ';
+  return out;
+}
+template <typename T>
+std::istream& operator>>(std::istream& in, vector<T>& vec) {
+  for (auto& x: vec) in >> x;
+  return in;
+}
+
+class AdventOfCode1 {
+public:
+  
+  void solve(std::istream& cin, std::ostream& cout) {
+    vector<int> a;
+    int x;
+    while (cin >> x) {
+      a.push_back(x);
+    }
+    int n = a.size();
+    int sum = 2020;
+    unordered_map<int, int> mp;
+    for (int i = 0; i < n; ++i) {
+      if (mp.count(sum - a[i])) {
+        cout << (sum - a[i]) * a[i] << '\n';
+      }
+      mp[a[i]]++;
+    }
+  }
+};
+
+int32_t main() {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+	AdventOfCode1 solver;
+	std::istream& in(std::cin);
+	std::ostream& out(std::cout);
+	solver.solve(in, out);
+	return 0;
+}