some-advent-of-code: Commit: 5fbc9413961c899e3f31fc0c2ff33911c706ad82

Branch: 1904-1

Author: Nicholas Prado <nmprado@nzen.ws>
Date: Thu Dec 5 07:03:55 UTC 2019
Commit: 5fbc9413961c899e3f31fc0c2ff33911c706ad82
Parent: d271ce605572471f42422a4d171bc2bd97fb16c8 (diff to parent)
Log message:

    temp i1904-1 partial draft that advances to the first value
    
    This can increment the first value up to one that satisfies the
    neighbor same or greater constraint. However, it doesn't check
    whether the pair constraint is satisfied. The first value does
    satisfy it, but it's better to have another pass that also
    satisfies the pair constraint, so the pair cursor is in the
    right spot before this starts incrementing.
    
    In case it's not clear from that description, I intend to
    generate the values, rather than do some combinatoric series
    analysis.

src/java/Exercise19041.java (old)                                 (diff) | 217 ++++++++++++++++++++++++++++++++++++++++++++
src/res/19_04_input.txt (old)                                     (diff) | 2 +
 2 files changed, 219 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)
    • Exercise19041.java (raw)
  • res
    • 18_01_input.txt (raw)
    • 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)
    • 19_04_input.txt (raw)