Win a copy of 97 Things Every Java Programmer Should Know this week in the Java in General forum!
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Campbell Ritchie
  • Paul Clapham
  • Jeanne Boyarsky
  • Junilu Lacar
  • Henry Wong
Sheriffs:
  • Ron McLeod
  • Devaka Cooray
  • Tim Cooke
Saloon Keepers:
  • Tim Moores
  • Stephan van Hulst
  • Frits Walraven
  • Tim Holloway
  • Carey Brown
Bartenders:
  • Piet Souris
  • salvin francis
  • fred rosenberger

Advent of Code 2018

 
Sheriff
Posts: 7616
522
Mac OS X VI Editor BSD Linux
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Yeah. Mine 9 days ago. I still would love to solve few days. I might still do.
 
Saloon Keeper
Posts: 12012
257
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
I really enjoyed day 17, but I got screwed over so badly because the example diagrams given are actually an edge case. The problem doesn't count ANY cells that are outside of the vertical range of the scan, including reachable cells that are above the first occurrence of clay. However, in the example the topmost cell that is reachable by water is already within range, making the number of reachable cells that you have to ignore 0.

I lost a lot of time with this puzzle because I didn't remove the topmost cells that are outside of the range of the scan, only the cells at the bottom.

Will eventually catch up with the other problems as well.
 
Where does a nanny get ground to air missles? Protect this tiny ad:
Devious Experiments for a Truly Passive Greenhouse!
https://www.kickstarter.com/projects/paulwheaton/greenhouse-1
    Bookmark Topic Watch Topic
  • New Topic