How to resolve the algorithm 100 doors step by step in the EasyLang programming language
How to resolve the algorithm 100 doors step by step in the EasyLang 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 EasyLang programming language
Source code in the easylang programming language
len d[] 100
for p = 1 to 100
i = p
while i <= 100
d[i] = 1 - d[i]
i += p
.
.
for i = 1 to 100
if d[i] = 1
print i
.
.
You may also check:How to resolve the algorithm Sequence: smallest number with exactly n divisors step by step in the F# programming language
You may also check:How to resolve the algorithm LZW compression step by step in the Java programming language
You may also check:How to resolve the algorithm Variadic function step by step in the Prolog programming language
You may also check:How to resolve the algorithm Integer overflow step by step in the REXX programming language
You may also check:How to resolve the algorithm Dot product step by step in the Visual Basic programming language