GH-321: Solve aco2015day1 (#322)

Author: rain1024

README.md

@@ -737,7 +737,7 @@ An algorithm is a finite sequence of rigorous instructions, typically used to so
 
 **Competitive Programming Events**
 
-* 🎄 Advent of Code ([2022](collections/advent-of-code-2022/))
+* 🎄 Advent of Code ([2015](collections/advent-of-code/2015/), [2022](collections/advent-of-code/2022/))
 * 🔰 Google Code Jam ([2022](collections/codejam-2022/))
 
 **Coding Problems Website**

collections/advent-of-code/2015/README.md

@@ -0,0 +1,30 @@
+# 🎄 Advent of Code 2015
+
+> Advent of Code is an Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like. People use them as interview prep, company training, university coursework, practice problems, a speed contest, or to challenge each other.
+
+> You don't need a computer science background to participate - just a little programming knowledge and some problem solving skills will get you pretty far. Nor do you need a fancy computer; every problem has a solution that completes in at most 15 seconds on ten-year-old hardware.
+
+* Website: https://adventofcode.com/2015/
+
+## Problems
+
+<table>
+<thead>
+<th></th>
+<th>Statement</th>
+<th>Part 1</th>
+<th>Part 2</th>
+</thead>
+<tbody>
+<tr>
+<td>Day 1</td>
+<td><a href="https://adventofcode.com/2015/day/1">Link</a></td>
+<td>
+<a href="../../../problems/aoc2015day1/src/main/solution1.cpp"><code>cpp</code></a>
+</td>
+<td>
+<a href="../../../problems/aoc2022day1/src/main/solution1.cpp"><code>cpp</code></a>
+</td>
+</tr>
+</tbody>
+</table>

collections/advent-of-code-2022/README.md renamed to collections/advent-of-code/2022/README.md

@@ -0,0 +1,5 @@
+solution
+solution1
+solution2
+*.dSYM
+python/main/__pycache__

problems/aoc2015day1/.gitignore

@@ -0,0 +1,10 @@
+# AoC Problem 
+
+## Usage
+
+Run program with an example
+
+```
+bazel run src/main:solution1 `pwd`/data/1.in
+bazel run src/main:solution2 `pwd`/data/2.in
+```

problems/aoc2015day1/README.md

@@ -0,0 +1 @@
+()()(()()()(()()((()((()))((()((((()()((((()))()((((())(((((((()(((((((((()(((())(()()(()((()()(()(())(()((((()((()()()((((())((((((()(()(((()())(()((((()))())(())(()(()()))))))))((((((((((((()())()())())(())))(((()()()((((()(((()(()(()()(()(()()(()(((((((())(())(())())))((()())()((((()()((()))(((()()()())))(())))((((())(((()())(())(()))(()((((()())))())((()(())(((()((((()((()(())())))((()))()()(()(()))))((((((((()())((((()()((((()(()())(((((()(()())()))())(((()))()(()(()(()((((()(())(()))(((((()()(()()()(()(((())())(((()()(()()))(((()()(((())())(()(())())()()(())()()()((()(((()(())((()()((())()))((()()))((()()())((((()(()()(()(((()))()(()))))((()(((()()()))(()(((())()(()((()())(()(()()(()())(())()(((()(()())()((((()((()))))())()))((()()()()(())()())()()()((((()))))(()(((()()(((((((())()))()((((()((())()(()())(())()))(()(()())(((((((())))(((()))())))))()))())((())(()()((())()())()))))()((()()())(())((())((((()())())()()()(((()))())))()()))())(()()()(()((((((()()))())()))()(((()(((())((((()()()(()))())()()))))())()))())((())()())(((((())())((())())))(((())(((())(((((()(((((())(()(()())())(()(())(()))(()((((()))())()))))())))((()(()))))())))(((((())()))())()))))()))))(((()))()))))((()))((()((()(()(())()())))(()()()(())()))()((((())))))))(())(()((()()))(()))(()))(()((()))))))()()((((()()))()())()))))))()()()))(()((())(()))((()()()())()(((()((((())())))()((((()(()))))))())))()()())()))(()))))(()())()))))))((())))))))())()))()((())())))(()((()))()))(())))))(()))()())()()))((()(()))()()()()))))())()()))())(())()()))()))((()))))()()(()())))))()()()))((((()))()))))(()(())))(()())))((())())(()))()))))()())))()())()())))))))))()()))))())))((())((()))))())))(((()())))))))(()))()()))(()))()))))()())))))())((((()())))))))())))()()))))))))()))()))))()))))))(())))))))))())))))))))))))))())())((())))))))))()))((())))()))))))))())()(()))))))())))))()()()())()(()()()(()())(()))()()()(()())))())())))()))))())))))))()()()()())(())())()())()))))(()()()()()))))()))())())))((()())()())))()))()))))(()())))()))))))))(((()))()()))))))))))))))))))))(()))(()((()))())))())(()))(()(()(())))))()(()))()))()()))))))))))))()((()())(())())()(())))))())()())((()()))))(()()))))())()(())()))))))))))))))))))))()))(()(()())))))))()()((()))()))))))((())))()))))))))((()))())()()))())()()))((()))())))))))))))(()())()))(())((()(()()))(()())(())))()())(()(())()()))))()))()(()))))))(()))))))))))(()))())))))))))())))))())))(())))))()))))(())())))))))))()(()))))()())))())(()))()())))))))))))))())()()))))()))))))())))))()))))(())(()()()()((())()))())(()))((())()))())())(())(()()))))()))(())()()((())(())))(())))()))())))))))))()(((((())())))(())()))))(())))((()))()(((((((()))))()()))(())))))()(()))))(()()))()))())))))))(()())()))))))))())))(()))())()))(())()((())())()())())(()(()))))()))))))((()())(())()()(()())))()()))(())(())(()))())))()))(()))()()))((((()))))()))((()()()))))()))()))())))(()))()))))(())))()))())()(()))()())))())))))))())))())))()()))))))(()))())())))()))()()())())))))))))))))())))()))(()()))))())))())()(())))())))))))))))))))))()()())())))))()()()((()(()))()()(())()())()))()))))()()()))))))((()))))))))()(()(()((((((()()((()())))))))))))()))())))))((())())(()))())))())))))())()()())(())))())))()())())(())))))))()()(())))()))())))())())())()))))))))()))(()()()())())())))(())())))))))()()())()))))())))())()(())())))))))()())()))(()()(())())))()(()((()()((()()(((((())(()())()))(())()))(())))(())))))))()))()))((()))()))()))))))))()))))))))((()()())(()))(((()))(())))()))((())(((())))()())))())))))((())))))(())())((((((())())()(()))()(()((()())))((())()(()(()))))(())(()()())(())))())((()(((())())))(((()())())))())()(())())((((()()))))())((()))()()()()(())(((((((()()()((()))())(()())))(())())((((()()(()))))()((())))((())()))()(((()))())))()))((()(()))(())(()((((())((((()()(()()))(((())(()))))((((()(()))(())))))((()))(()))((()(((()(()))(()(()((()(())(()(()(()(()()((()))())(((())(()(()))))(()))()()))(())))(())()(((())(()))()((((()()))))())(()))))((())()((((()(((()))())())(((()))()())((())(())())(())()(())()(()()((((((()()))))()()(((()()))))()())()(((()(()))(()(()())(()(()))))(((((()(((())())))))(((((()((()()((())())((((((()(())(()()((()()()()()()()(()()))()(((()))()))(((((((())(((()((()())()((((())(((()(())))()((()(()()()((())((()())()))()))())))())((((((()))(()(()()()))(()((()(()(()))()((()(((()()()((())(((((())()(()))())())((()(())))(()(()())(())((())())())(((()()()(())))))())(()))))))()))))))())((()()()))((()((((((()))(((()((((()()()(((()))())()(()()(((()((()()()()())()()))()()()(()(())((()))))(()))())))))))()(()()(((((())()(()(((((()((()(()()())(()((((((((()((((((())()((((()()()((()((()((((((()))((())))))))())()))((()(()))()(()()(()((())((()()((((((((((((()())(()()()))((((()((((((())(()))())(()()((()()))()(((((((()((()()((((((()(((())))((())))((((((((()()(((((((())(((((()())(((())((())()((((()(((((((()(()(((()((((((()(((()(((((((((((()()((()()(()))((()()(((()(((())))((((())()(()(((())()(()(((())(((((((((((()))())))((((((())((()()((((()())())((((()()))((())(((((()(()()(()()()((())(()((()()((((()(((((()((()(()((((()())((((((()(((((()()(()(()((((())))(())(())(())((((()(()()((((()((((()()((()((((((())))(((((()))))()))(()((((((((()(((())())(((())))(()(()((())(((()((()()(((((()((()()(((())()(()))(((((((())(()(((((()))((()((()((()))(())())((((()((((())()(()))(((()(((((((((((((((())(((((((((()))(((()(()()()()((((((()((())()((((((((()(())(((((((((((()(()((())()((()()(()(()()((((()()((())(()((()()(()()((((()(((((((())))((((())(())()(((()()((()()((((()((()(((()((())(((()()()((((()((((()()(()(()((((((((())(()(((((())(()())(((((((()())()(()((((()((())(()()())((((()()(((()((((())(())(()()(((((((((()()))()(((())(()(()((((((())(()()())(()))()()(((()(((()((())(()(((((((()(()(()((()(((((()(()((()(()((((((()((((()()((((()(((()((())(()(()((()()((((()()(())()(())(((())(()((((((((()())(((((((((()(())()((((())))()))()()(((((()()((((((())(()()(((()(()(((((((()(()(((((((())(())((((()((()(())))((((()()())(()))((()())((((()(((((()(()(())(()(()()())(((((()(((((()((((()()((((((((()()))(()((((((())((((())()(()(((()()()(((()(()(())(())(((((()(())())((((())(())(()(((()(((((())((((())())((()(((((((()(((())(()(()))(((((((((()((()((()()(()((((())(((()((())((((())(()(((()(((()(()((((()(((())(()(((()(()()(()(()((()()(()())(())())((()(()(((()(((()(((()()(((((((((()(((((((((()()(((()(((()())((((()(()(((()()()((())((((((((((())(()(((()((((()())((((()((()))(((()()()(((((()(((((((())((()())(()((((())((((((((())(()((()((((((((((()()((()((()()))(((()())()())()(((()())()()(()(()(((((((())()))(())()))())()()((())()((()((((()((()((())(((((()((((((()(())))(()))())(((()))((()()(()(((()))((((())()(((()))))()(()(())()(((((())(()(()(())(())()((()()()((((()(())((()())(()(()))(()(()(()()(())()()(()((())()((()))))()))((()(()()()()((()())(()))())()(()(((((((((())())((()((()((((((())()((((())(((())((()(()()()((())(()((())(((()((((()()((()(()(((((())()))()((((((()))((())(((()()))(((())(())()))(((((((())(())())()(())(((((()))()((()))()(()()((()()()()()())(((((((

problems/aoc2015day1/data/1.in

@@ -0,0 +1 @@
+280

problems/aoc2015day1/data/1.out

@@ -0,0 +1,15 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary")
+
+cc_binary(
+    name = "solution1",
+    srcs = ["solution1.cpp", "helpers.h"],
+    visibility = ["//visibility:public"],
+    copts = ["-std=c++17"]
+)
+
+cc_binary(
+    name = "solution2",
+    srcs = ["solution2.cpp", "helpers.h"],
+    visibility = ["//visibility:public"],
+    copts = ["-std=c++17"]
+)

tools/craft/templates/aoc/data/input2.txt renamed to problems/aoc2015day1/data/2.in

@@ -0,0 +1,59 @@
+#pragma once
+
+#include <string>
+#include <vector>
+#include <iostream>
+#include <stack>
+#include <queue>
+
+using namespace std;
+
+/* Temmplate class T should be a Nary Tree Node
+ * See leetcode 589 (https://leetcode.com/problems/n-ary-tree-preorder-traversal/description/)
+ * class Node {
+ *  public:
+ *   int val;
+ *   vector<Node*> children;
+ * 
+ *   Node() {}
+ * 
+ *   Node(int _val) { val = _val; }
+ * 
+ *   Node(int _val, vector<Node*> _children) {
+ *     val = _val;
+ *     children = _children;
+ *   }
+ * };
+*/
+template <typename T> T* parse_nary_tree(vector<string> s) {
+  T* fake = new T();
+  T* current = fake;
+  queue<T*> q;
+  for(string e: s){
+    if(e == "null"){
+      current = q.front();
+      q.pop();
+    } else {
+      T* child = new T(stoi(e));
+      q.push(child);
+      current->children.push_back(child);
+    }
+  }
+  return fake->children[0];
+}
+
+vector<string> parse_line(string line) {
+  vector<string> v;
+  string s;
+  for (char c : line) {
+    if (c == ' ') {
+      v.push_back(s);
+      s = "";
+    } else {
+      s += c;
+    }
+  }
+  v.push_back(s);
+  return v;
+}
+

tools/craft/templates/aoc/data/output2.txt renamed to problems/aoc2015day1/data/2.out

@@ -0,0 +1,41 @@
+#include <algorithm>
+#include <cmath>
+#include <filesystem>
+#include <fstream>
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+
+#include "helpers.h"
+
+using namespace std;
+
+pair<int, int> solve(string s){
+  int f = 0; // floor
+  int p = -1; // position
+  for(int i=0; i<s.size(); i++){
+    if(s[i] == '('){
+      f++;
+    } else {
+      f--;
+    }
+    if(f == -1 && p == -1){
+      p = i + 1;
+    }
+  }
+  return make_pair(f, p);
+}
+
+int main(int argc, char* argv[]) {
+  string input = argv[1];
+  string line;
+  fstream f(input);
+  getline(f, line);
+  f.close();
+  auto [finalFloor, firstBasementEntry] = solve(line);
+  cout << "finalFloor = " << finalFloor << endl;
+  cout << "firstBasementEntry = " << firstBasementEntry << endl;
+  return 0;
+}

problems/aoc2015day1/src/main/BUILD

@@ -0,0 +1,31 @@
+#include <algorithm>
+#include <cmath>
+#include <filesystem>
+#include <fstream>
+#include <iostream>
+#include <map>
+#include <string>
+#include <vector>
+
+#include "helpers.h"
+
+using namespace std;
+
+int main(int argc, char* argv[]) {
+  string input = argv[1];
+  string line;
+  fstream f(input);
+  long long sum_c = 0;
+  vector<long long> v;
+  while (getline(f, line)) {
+    if (line.size() == 0) {
+      v.push_back(sum_c);
+      sum_c = 0;
+    } else {
+      sum_c += stoi(line);
+    }
+  }
+  sort(v.begin(), v.end(), greater<long long>());
+  long long total = v[0] + v[1] + v[2];
+  cout << "max_c = " << total << endl;
+}

problems/aoc2015day1/src/main/helpers.h

@@ -0,0 +1,7 @@
+# Tools
+
+ Craft a problem with the following command:
+
+ ```
+ python craft.py
+ ```

problems/aoc2015day1/src/main/solution1.cpp

@@ -1 +1,5 @@
-solution
+solution
+solution1
+solution2
+*.dSYM
+python/main/__pycache__

problems/aoc2015day1/src/main/solution2.cpp

@@ -5,6 +5,6 @@
 Run program with an example
 
 ```
-bazel run src/main:solution1 `pwd`/data/input1.txt
-bazel run src/main:solution1 `pwd`/data/input2.txt
+bazel run src/main:solution1 `pwd`/data/1.in
+bazel run src/main:solution2 `pwd`/data/2.in
 ```

tools/README.md

@@ -0,0 +1,4 @@
+1
+2
+3
+4

tools/craft/templates/aoc/.gitignore

@@ -0,0 +1 @@
+10