# 100 doors

This page is the answer to the task 100 doors in the Rosetta Code.

### Description (from Rosetta Code)

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 The second time, only visit every 2 The third time, visit every 3
Answer the question: what state are the doors in after the last pass? Which are open, which are closed?
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. |

### Program

### Results

### Showing the intermediate states

The problem can be generalized to a different number of doors other than 100.

The following variation creates an image with the intermediate results. Horizontal axis (left to right) represents the number of door, vertical axis (top to bottom) is the the number of vist.

The following is the history for 100 doors. Each square is 3x3 pixels.

The next one is the history for 500 doors. Each square is 1x1 pixel.