How to resolve the algorithm 100 doors step by step in the Erlang programming language
How to resolve the algorithm 100 doors step by step in the Erlang programming language
Table of Contents
Problem Statement
There are 100 doors in a row that are all initially closed.
You make 100 passes by the doors.
The first time through, visit every door and toggle the door (if the door is closed, open it; if it is open, close it).
The second time, only visit every 2nd door (door #2, #4, #6, ...), and toggle it.
The third time, visit every 3rd door (door #3, #6, #9, ...), etc, until you only visit the 100th door.
Answer the question: what state are the doors in after the last pass? Which are open, which are closed?
Alternate:
As noted in this page's discussion page, the only doors that remain open are those whose numbers are perfect squares.
Opening only those doors is an optimization that may also be expressed;
however, as should be obvious, this defeats the intent of comparing implementations across programming languages.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm 100 doors step by step in the Erlang programming language
Source code in the erlang programming language
-module(hundoors).
-export([go/0]).
toggle(closed) -> open;
toggle(open) -> closed.
go() -> go([closed || _ <- lists:seq(1, 100)],[], 1, 1).
go([], L, N, _I) when N =:= 101 -> lists:reverse(L);
go([], L, N, _I) -> go(lists:reverse(L), [], N + 1, 1);
go([H|T], L, N, I) ->
H2 = case I rem N of
0 -> toggle(H);
_ -> H
end,
go(T, [H2|L], N, I + 1).
array_go() -> go(array:new([101, fixed, {default, closed}]), 1, 1).
go(Array, Big, Inc) when Big > 100, Inc =< 100 ->
go(Array, Inc + 1, Inc + 1);
go(Array, Index, Inc) when Inc < 101 ->
go(array:set(Index, toggle(Array, Index), Array), Index + Inc, Inc);
go(Array, _, _) -> array:sparse_to_orddict(Array).
toggle(Array, Index) -> toggle(array:get(Index, Array)).
doors() ->
F = fun(X) -> Root = math:pow(X,0.5), Root == trunc(Root) end,
Out = fun(X, true) -> io:format("Door ~p: open~n",[X]);
(X, false)-> io:format("Door ~p: close~n",[X]) end,
[Out(X,F(X)) || X <- lists:seq(1,100)].
You may also check:How to resolve the algorithm Split a character string based on change of character step by step in the JavaScript programming language
You may also check:How to resolve the algorithm Unix/ls step by step in the S-lang programming language
You may also check:How to resolve the algorithm Apply a callback to an array step by step in the VBScript programming language
You may also check:How to resolve the algorithm Substring/Top and tail step by step in the Scala programming language
You may also check:How to resolve the algorithm Permutations step by step in the 360 Assembly programming language