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
defmodule Evenodd do | |
def start() do even_odd_sort([],[]) |> print_list end | |
defp print_list(list) do Enum.map list, &(IO.puts(&1)) end | |
defp even_odd_sort(odd,even) do | |
case getline do | |
{ :done, :done } -> make_new_list(even,odd) | |
{ line, :odd} -> even_odd_sort( [line] ++ odd, even) | |
{ line, :even} -> even_odd_sort( odd,[line] ++ even) |
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
defmodule Evenodd do | |
def start() do even_odd_sort([],[]) |> print_list end | |
defp print_list(list) do Enum.map list, &(IO.puts(&1)) end | |
defp even_odd_sort(odd,even) do | |
case getline do | |
{ :done, :done } -> make_new_list(even,odd) | |
{ line, :odd} -> even_odd_sort( [line] ++ odd, even) | |
{ line, :even} -> even_odd_sort( odd,[line] ++ even) |
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
defmodule Dupe do | |
def main(:done, list) do | |
list | |
|> HashDict.to_list | |
|> Enum.sort | |
|> Enum.map(fn(x) -> if elem(x,1) > 1 do IO.puts "#{elem(x,0)} (#{elem(x,1)})" end end) | |
end | |
def main(_,list) do | |
line = readline() |