2016 Update

Task/Chinese-remainder-theorem/Elixir/chinese-remainder-theorem.elixir

@@ -2,9 +2,9 @@ defmodule Chinese do
   def remainder(mods, remainders) do
     max = Enum.reduce(mods, fn x,acc -> x*acc end)
     Enum.zip(mods, remainders)
-    |> Enum.map(fn {m,r} -> Enum.take_every(r..max, m) |> Enum.into(HashSet.new) end)
-    |> Enum.reduce(fn set,acc -> Set.intersection(set, acc) end)
-    |> Set.to_list
+    |> Enum.map(fn {m,r} -> Enum.take_every(r..max, m) |> MapSet.new end)
+    |> Enum.reduce(fn set,acc -> MapSet.intersection(set, acc) end)
+    |> MapSet.to_list
   end
 end