This week I have a legitimate reason for posting quite late: the E3 deadline was delayed through March 16, and in lieu of prematurely posting my garbage code, I decided to save my large set of steadfast followers (count: 0) the pain of failing E3.
E3 part 2 seemed to be giving several of my fellow coders quite an itch: naturally, this lead me to suspect my code. Turns out I was finding simply the maximum node sum rather than the maximum sum of the maximum path length. Following instructions is a bit more difficult than previously imagined.
And now began my turmoil: I finished A2 while listening to Korpiklaani, but could not figure out e3b, and the matter rests unresolved.
As for preparation for Test 2: I will continue to attempt e3, and monitor berkeycolortran's blog.
