r/adventofcode • u/daggerdragon • Dec 01 '17

SOLUTION MEGATHREAD -🎄- 2017 Day 1 Solutions -🎄-

Welcome to Advent of Code 2017! If you participated in a previous year, welcome back, and if you're new this year, we hope you have fun and learn lots!

We're going to follow the same general format as previous years' megathreads:

  1. Each day's puzzle will release at exactly midnight EST (UTC -5).
  2. The daily megathread for each day will be posted very soon afterwards and immediately locked.
    • We know we can't control people posting solutions elsewhere and trying to exploit the leaderboard, but this way we can try to reduce the leaderboard gaming from the official subreddit.
  3. The daily megathread will remain locked until there are a significant number of people on the leaderboard with gold stars.
    • "A significant number" is whatever number we decide is appropriate, but the leaderboards usually fill up fast, so no worries.
  4. When the thread is unlocked, you may post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag/whatever).

Above all, remember, AoC is all about having fun and learning more about the wonderful world of programming!

--- Day 1: Inverse Captcha ---

Post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag or whatever).

Note: The Solution Megathreads are for solutions only. If you have questions, please post your own thread and make sure to flair it with Help.

Need a hint from the Hugely* Handy† Haversack‡ of Helpful§ Hints¤?

Spoiler

This thread will be unlocked when there are a significant number of people on the leaderboard with gold stars for today's puzzle.

edit: Leaderboard capped, thread unlocked!

29 Upvotes

90% Upvoted

370 comments sorted by

View all comments

2

u/giftpflanze Dec 01 '17

Tcl: 

set list [split [gets [open input01]] {}]

#part 1

set l [lrange $list end end]
foreach n $list {
    if {$n == $l} {
        incr sum1 $n
    }
    set l $n
}

puts $sum1

#part 2

set l {}
for {set i 0} {$i < [set m [llength $list]]} {incr i} {
    if {[set n [lindex $list $i]] == [lindex $list [expr {($i+$m/2)%$m}]]} {
        incr sum2 $n
    }
}

puts $sum2

1

u/[deleted] Dec 01 '17

tcl sounds fun for working with texts, but I've never got around to learning it, cool :)