How to resolve the algorithm 100 doors step by step in the Gambas programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm 100 doors step by step in the Gambas 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 Gambas programming language

Source code in the gambas programming language

Public Sub Main()
Dim bDoor As New Boolean[101]
Dim siCount1, siCount2, siStart As Short

For siCount1 = 1 To 100
  Inc siStart
  For siCount2 = siStart To 100 Step siCount1
    bDoor[siCount2] = Not bDoor[siCount2]
  Next
Next

For siCount1 = 1 To 100
  If bDoor[siCount1] Then Print siCount1;;
Next

End

  

You may also check:How to resolve the algorithm Morse code step by step in the OCaml programming language
You may also check:How to resolve the algorithm Hello world/Graphical step by step in the Quackery programming language
You may also check:How to resolve the algorithm One-time pad step by step in the Racket programming language
You may also check:How to resolve the algorithm Calendar - for REAL programmers step by step in the Tcl programming language
You may also check:How to resolve the algorithm Fibonacci word/fractal step by step in the Nim programming language