some-advent-of-code: Commit: 3bc71c4f6028d13e8cf2932e9ae55a9b5e5c97d4

Branch: 1903-2

Author: Nicholas Prado <nmprado@nzen.ws>
Date: Tue Dec 3 09:24:08 UTC 2019
Commit: 3bc71c4f6028d13e8cf2932e9ae55a9b5e5c97d4
Parent: cf8b3f1d5af1d5e024e52d55740a7645e72402ce (diff to parent)
Log message:

    feat solves D3 p1
    
    Makes sets of integral points that the wires lay down. Finds a
    set of intersectons. Determines which intersection point has
    the smallest taxicab geometry distance from the origin. It's
    worth noting that this renders the grid rotated from the trivial
    example, but the coordinates are the same. This makes no provision
    for the size of your console, should you render a large grid.

src/java/Exercise19031.java (old)                                 (diff) | 457 ++++++++++++++++++++++++++++++++++++++
src/res/19_03_input.txt (old)                                     (diff) | 2 +
src/res/19_03_input_easy_135.txt (old)                            (diff) | 2 +
src/res/19_03_input_easy_159.txt (old)                            (diff) | 2 +
src/res/19_03_input_trivial_6.txt (old)                           (diff) | 2 +
 5 files changed, 465 insertions(+)

Files:

• cryptographic autonomy license v1.md (raw)
• readme.adoc (raw)
• src
  • java
    • Exercise18021.java (raw)
    • Exercise18022.java (raw)
    • Exercise18031.java (raw)
    • Exercise19011.java (raw)
    • Exercise19012.java (raw)
    • Exercise19021.java (raw)
    • Exercise19022.java (raw)
    • Exercise19031.java (raw)
  • res
    • 18_02_input.txt (raw)
    • 18_03_input.txt (raw)
    • 19_01_input.txt (raw)
    • 19_02_input_easy.txt (raw)
    • 19_02_input_p1.txt (raw)
    • 19_02_input_p2.txt (raw)
    • 19_03_input.txt (raw)
    • 19_03_input_easy_135.txt (raw)
    • 19_03_input_easy_159.txt (raw)
    • 19_03_input_trivial_6.txt (raw)