FINAL problem selection for NCNA 2018, ranked in presumed difficulty.

  Computing e - Joshua and Kate, jguerin@utm.edu, kericson@utm.edu - completely straightforward.
  Needs: Appears complete!

  Palindrome - Alexander Scheel, alexander.m.scheel@gmail.com - harder to code than Lipschitz but brute-force-able, easy to see solution.
  Needs: Appears complete!

  Lipschitz - Volodymyr Lyubinets, vlyubin@gmail.com - requires minor insight, easy to code.
  Needs: Appears complete!

  Travel the Skies! - Alexander Scheel, alexander.m.scheel@gmail.com - pretty straightforward, just takes time to understand and implement a simulation.
  Needs: Appears complete!

  Other Side - Volodymyr Lyubinets, vlyubin@gmail.com - takes time to get the right formula, but not much coding/ algorithms insight.
  Needs: Appears complete!

  Maximum Subarrays - Bryce Sandlund, bcsandlund@uwaterloo.ca - DP. Natural extension of single subarray version but tricky.
  Needs: Appears complete!

  Rational - David Poplawski, pop@mtu.edu - math problem. Hard to come up with the formula.
  Needs: Check naive solutions fail, brute force TLEs

  Tima goes to Xentopia - Vaibhav Tulsyan, vstulsyan@gmail.com - tricky graph problem. Takes insight and coding time to solve.
  Needs: Java DP soluiton.

  Pokegene - Nalin Bhardwaj, nalinbhardwaj@nibnalin.me - string problem. Takes both insight and coding time to solve.
  Needs: Appears complete!

  New Salaries - Volodymyr Lyubinets, vlyubin@gmail.com - hard expected value problem.
  Needs: Appears complete!
