This week's book giveaway is in the Cloud/Virtualization forum.
We're giving away four copies of Grokking Bitcoin and have Kalle Rosenbaum on-line!
See this thread for details.
Win a copy of Grokking Bitcoin this week in the Cloud/Virtualization 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 ...
  • Campbell Ritchie
  • Liutauras Vilda
  • Bear Bibeault
  • Tim Cooke
  • Junilu Lacar
  • Paul Clapham
  • Devaka Cooray
  • Knute Snortum
Saloon Keepers:
  • Ron McLeod
  • Tim Moores
  • Stephan van Hulst
  • Tim Holloway
  • Frits Walraven
  • Carey Brown
  • salvin francis
  • Claude Moore

Advent of Code 2018  RSS feed

Posts: 6685
BSD Linux Mac OS X VI Editor
  • 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: 10107
  • 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.
If you have a bad day in October, have a slice of banana cream pie. And this tiny ad:
Create Edit Print & Convert PDF Using Free API with Java
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!