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

Published on 12 May 2024 09:40 PM

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

Source code in the purebasic programming language

Dim doors.i(100)
 
For x = 1 To 100
  y = x
  While y <= 100
    doors(y) = 1 - doors(y)
    y + x
  Wend
Next
 
OpenConsole()
PrintN("Following Doors are open:")
For x = 1 To 100
  If doors(x)
    Print(Str(x) + ", ")
  EndIf
Next
Input()

OpenConsole()
PrintN("Following Doors are open:")
For i = 1 To 100
    root.f = Sqr(i)
    If root = Int(root)
    	Print (Str(i) + ", ")
    EndIf
Next     
Input()

  

You may also check:How to resolve the algorithm Combinations with repetitions step by step in the 11l programming language
You may also check:How to resolve the algorithm Kernighans large earthquake problem step by step in the Groovy programming language
You may also check:How to resolve the algorithm Towers of Hanoi step by step in the VTL-2 programming language
You may also check:How to resolve the algorithm Miller–Rabin primality test step by step in the Oz programming language
You may also check:How to resolve the algorithm Queue/Definition step by step in the ARM Assembly programming language