Last active
December 14, 2017 09:41
-
-
Save davidsulc/1b14071c021dfe20e62149e61c5cb279 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# http://adventofcode.com/2017/day/1 | |
defmodule Day1B do | |
@input "36743676522426214741687639282183216978128565594112364817283598621384839756628424146779311928318383597235968644687665159591573413233616717112157752469191845757712928347624726438516211153946892241449523148419426259291788938621886334734497823163281389389853675932246734153563861233894952657625868415432316155487242813798425779743561987563734944962846865263722712768674838244444385768568489842989878163655771847362656153372265945464128668412439248966939398765446171855144544285463517258749813731314365947372548811434646381595273172982466142248474238762554858654679415418693478512641864168398722199638775667744977941183772494538685398862344164521446115925528534491788728448668455349588972443295391385389551783289417349823383324748411689198219329996666752251815562522759374542652969147696419669914534586732436912798519697722586795746371697338416716842214313393228587413399534716394984183943123375517819622837972796431166264646432893478557659387795573234889141897313158457637142238315327877493994933514112645586351127139429281675912366669475931711974332271368287413985682374943195886455927839573986464555141679291998645936683639162588375974549467767623463935561847869527383395278248952314792112113126231246742753119748113828843917812547224498319849947517745625844819175973986843636628414965664466582172419197227695368492433353199233558872319529626825788288176275546566474824257336863977574347328469153319428883748696399544974133392589823343773897313173336568883385364166336362398636684459886283964242249228938383219255513996468586953519638111599935229115228837559242752925943653623682985576323929415445443378189472782454958232341986626791182861644112974418239286486722654442144851173538756859647218768134572858331849543266169672745221391659363674921469481143686952478771714585793322926824623482923579986434741714167134346384551362664177865452895348948953472328966995731169672573555621939584872187999325322327893336736611929752613241935211664248961527687778371971259654541239471766714469122213793348414477789271187324629397292446879752673" | |
defp split_in_2(l) when is_list(l) do | |
half_length = div(length(l), 2) | |
l |> Enum.chunk_every(half_length, half_length) | |
end | |
defp reduce_matching_pair({x, x}, acc), do: acc + 2 * String.to_integer(x) | |
defp reduce_matching_pair({_, _}, acc), do: acc | |
def run() do | |
@input | |
|> String.graphemes | |
|> split_in_2 | |
|> List.zip | |
|> Enum.reduce(0, &reduce_matching_pair/2) | |
|> IO.inspect | |
end | |
end | |
Day1B.run() |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment