lilbool/vuln-code-analysis

1[
2    {
3        "filename": "100 doors_1.txt",
4        "content": "V doors = [0B] * 100\nL(i) 100\n   L(j) (i .< 100).step(i + 1)\n      doors[j] = !doors[j]\n   print(\u2018Door \u2019(i + 1)\u2018: \u2019(I doors[i] {\u2018open\u2019} E \u2018close\u2019))",
5        "safe": true
6    },
7    {
8        "filename": "100 doors_10.txt",
9        "content": "page:\tequ\t2\t; Store doors in page 2\ndoors:\tequ\t100\t; 100 doors\nputs:\tequ\t9\t; CP/M string output\n\torg\t100h\n\txra\ta\t; Set all doors to zero\n\tlxi\th,256*page\n\tmvi\tc,doors\nzero:\tmov\tm,a\n\tinx\th\n\tdcr\tc\n\tjnz\tzero\n\tmvi\tm,'$'\t; CP/M string terminator (for easier output later)\n\tmov\td,a\t; D=0 so that DE=E=pass counter\n\tmov\te,a\t; E=0, first pass\n\tmvi\ta,doors-1\t; Last pass and door\npass:\tmov\tl,e\t; L=door counter, start at first door in pass\ndoor:\tinr\tm\t; Incrementing always toggles the low bit\n\tdad\td\t; Go to next door in pass\n\tinr\tl\n\tcmp\tl\t; Was this the last door?\n\tjnc\tdoor\t; If not, do the next door\n\tinr\te\t; Next pass\n\tcmp\te\t; Was this the last pass?\n\tjnc\tpass\t; If not, do the next pass\n\tlxi\th,256*page\n\tmvi\tc,doors\t; Door counter\n\tlxi\td,130h\t; D=1 (low bit), E=30h (ascii 0)\nchar:\tmov\ta,m\t; Get door\t\n\tana\td\t; Low bit gives door status\n\tora\te\t; ASCII 0 or 1\n\tmov\tm,a\t; Write character back\n\tinx\th\t; Next door\n\tdcr\tc\t; Any doors left?\n\tjnz\tchar\t; If so, next door\n\tlxi\td,256*page\n\tmvi\tc,puts\t; CP/M system call to print the string\n\tjmp\t5",
10        "safe": true
11    },
12    {
13        "filename": "100 doors_100.txt",
14        "content": "10 DIM D(100)\n20 FOR I=1 TO 100\n30 FOR J=I TO 100 STEP I\n40 LET D(J)=NOT D(J)\n50 NEXT J\n60 NEXT I\n70 FOR I=1 TO 100\n80 IF D(I) THEN PRINT I,\n90 NEXT I\n",
15        "safe": true
16    },
17    {
18        "filename": "100 doors_101.txt",
19        "content": "@echo off\nsetlocal enableDelayedExpansion\n:: 0 = closed\n:: 1 = open\n:: SET /A treats undefined variable as 0\n:: Negation operator\u00a0! must be escaped because delayed expansion is enabled\nfor /l %%p in (1 1 100) do for /l %%d in (%%p %%p 100) do set /a \"door%%d=^!door%%d\"\nfor /l %%d in (1 1 100) do if !door%%d!==1 (\n  echo door %%d is open\n) else echo door %%d is closed\n",
20        "safe": true
21    },
22    {
23        "filename": "100 doors_102.txt",
24        "content": "@echo off\nsetlocal enableDelayedExpansion\nset /a square=1, incr=3\nfor /l %%d in (1 1 100) do (\n  if %%d neq !square! (echo door %%d is closed) else (\n    echo door %%d is open\n    set /a square+=incr, incr+=2\n  )\n)\n",
25        "safe": true
26    },
27    {
28        "filename": "100 doors_103.txt",
29        "content": "DIM doors%(100)\nFOR pass% = 1 TO 100\n    FOR door% = pass% TO 100 STEP pass%\n        doors%(door%) = NOT doors%(door%)\n    NEXT door%\nNEXT pass%      \nFOR door% = 1 TO 100\n    IF doors%(door%) PRINT \"Door \" ; door% \" is open\"\nNEXT door%\n",
30        "safe": true
31    },
32    {
33        "filename": "100 doors_104.txt",
34        "content": "/* 0 means door is closed, 1 means door is open */\nfor (i = 0; i < 100; i++) {\n    for (j = i; j < 100; j += (i + 1)) {\n        d[j] = 1 - d[j]     /* Toggle door */\n    }\n}\n\n\"Open doors:\n\"\nfor (i = 0; i < 100; i++) {\n    if (d[i] == 1) (i + 1)\n}\n",
35        "safe": true
36    },
37    {
38        "filename": "100 doors_105.txt",
39        "content": "get \"libhdr\"\n\nlet start() be \n$(  let doors = vec 100\n\n    // close all doors\n    for n = 1 to 100 do doors!n\u00a0:= 0\n\n    // make 100 passes\n    for pass = 1 to 100 do\n    $(  let n = pass\n        while n <= 100 do\n        $(  doors!n\u00a0:= ~doors!n\n            n\u00a0:= n + pass\n        $)\n    $)\n    \n    // report which doors are open\n    for n = 1 to 100 do\n        if doors!n then\n            writef(\"Door %N is open.*N\", n)\n$)",
40        "safe": true
41    },
42    {
43        "filename": "100 doors_106.txt",
44        "content": "Door 1 is open.\nDoor 4 is open.\nDoor 9 is open.\nDoor 16 is open.\nDoor 25 is open.\nDoor 36 is open.\nDoor 49 is open.\nDoor 64 is open.\nDoor 81 is open.\nDoor 100 is open.",
45        "safe": true
46    },
47    {
48        "filename": "100 doors_107.txt",
49        "content": ">\"d\">:00p1-:>:::9%\\9/9+g2%!\\:9v\n$.v_^#!$::$_^#`\"c\":+g00p+9/9\\%<\n::<_@#`$:\\*:+55:+1p27g1g+9/9\\%9\n",
50        "safe": true
51    },
52    {
53        "filename": "100 doors_108.txt",
54        "content": "1+:::*.9`#@_\n",
55        "safe": true
56    },
57    {
58        "filename": "100 doors_109.txt",
59        "content": "108p0>:18p;;>:9g!18g9p08g]\n*`!0\\|+relet|-1`*aap81::+]\n;::+1<r]!g9;>$08g1+:08paa[\n*`#@_^._aa\n",
60        "safe": true
61    },
62    {
63        "filename": "100 doors_11.txt",
64        "content": "1001000010000001000000001000000000010000000000001000000000000001000000000000000010000000000000000001",
65        "safe": true
66    },
67    {
68        "filename": "100 doors_110.txt",
69        "content": "0001000100010101000110100000010110000011001110110010100011010000000000101111111000000101111101011001011001000110100001111100110100101111101111000000001011111111110110011001111111011100000000101111110000001011111010110011011100101011000000101111011001011110011110011110110100000000001011011100111011110000000001000000111001110100000000101101110110",
70        "safe": true
71    },
72    {
73        "filename": "100 doors_111.txt",
74        "content": "1001000010000001000000001000000000010000000000001000000000000001000000000000000010000000000000000001",
75        "safe": true
76    },
77    {
78        "filename": "100 doors_112.txt",
79        "content": "var doors = [false] * 100\nfor i in 0..100 {\n  iter var j = i; j < 100; j += i + 1 {\n    doors[j] = !doors[j]\n  }\n  var state = doors[i]\u00a0? 'open'\u00a0: 'closed'\n  echo 'Door ${i + 1} is ${state}'\n}",
80        "safe": true
81    },
82    {
83        "filename": "100 doors_113.txt",
84        "content": "for i in 1..101 {\n  echo 'Door ${i} is ${i ** 0.5\u00a0% 1 > 0\u00a0? \"closed\"\u00a0: \"open\"}'\n}",
85        "safe": true
86    },
87    {
88        "filename": "100 doors_114.txt",
89        "content": "for i in 1..11 echo 'Door ${i**2} is open'",
90        "safe": true
91    },
92    {
93        "filename": "100 doors_115.txt",
94        "content": "Graphics 640,480\ni=1\nWhile ((i*i)<=100)\n\ta$=i*i\n\tDrawText a$,10,20*i\n\tPrint i*i\n\ti=i+1 \nWend\nFlip \nWaitKey\n",
95        "safe": true
96    },
97    {
98        "filename": "100 doors_116.txt",
99        "content": "DEFINE PROCEDURE ''DIVIDE'' [A,B]:\nBLOCK 0: BEGIN\n  IF A < B, THEN:\n    QUIT BLOCK 0;\n  CELL(0) <= 1;\n  OUTPUT <= 1;\n  LOOP AT MOST A TIMES:\n  BLOCK 2: BEGIN\n    IF OUTPUT * B = A, THEN:\n    QUIT BLOCK 0;\n    OUTPUT <= OUTPUT + 1;\n    IF OUTPUT * B > A, THEN:\n    BLOCK 3: BEGIN\n      OUTPUT <= CELL(0);\n      QUIT BLOCK 0;\n    BLOCK 3: END;\n    CELL(0) <= OUTPUT;\n  BLOCK 2: END;\nBLOCK 0: END.\n\nDEFINE PROCEDURE ''MINUS'' [A,B]:\nBLOCK 0: BEGIN\n  IF A < B, THEN:\n    QUIT BLOCK 0;\n  LOOP AT MOST A TIMES:\n  BLOCK 1: BEGIN\n    IF OUTPUT + B = A, THEN:\n      QUIT BLOCK 0;\n    OUTPUT <= OUTPUT + 1;\n  BLOCK 1: END;\nBLOCK 0: END.\n\nDEFINE PROCEDURE ''MODULUS'' [A,B]:\nBLOCK 0: BEGIN\n  CELL(0) <= DIVIDE[A,B];\n  OUTPUT <= MINUS[A,CELL(0) * B];\nBLOCK 0: END.\n\n\n\nDEFINE PROCEDURE ''TOGGLE'' [DOOR]:\nBLOCK 0: BEGIN\n  IF DOOR = 1, THEN:\n    QUIT BLOCK 0;\n  OUTPUT <= 1;\nBLOCK 0: END.\n\nDEFINE PROCEDURE ''NUMBERS'' [DOOR, COUNT]:\nBLOCK 0: BEGIN\n  CELL(0) <= 1; /*each number*/\n  OUTPUT <= 0; /*current door state*/\n  \n  LOOP COUNT TIMES:\n  BLOCK 1: BEGIN\n\n    IF MODULUS[DOOR, CELL(0)] = 0, THEN:\n      OUTPUT <= TOGGLE[OUTPUT];\n    \n    CELL(0) <= CELL(0) + 1;\n\n  BLOCK 1: END;\n\nBLOCK 0: END.\n\nDEFINE PROCEDURE ''DOORS'' [COUNT]:\nBLOCK 0: BEGIN\n\n  CELL(0) <= 1; /*each door*/\n  LOOP COUNT TIMES:\n  BLOCK 1: BEGIN\n\n    CELL(1) <= NUMBERS[CELL(0), COUNT];  /*iterate over the states of this door to get its final state*/\n    IF CELL(1) = 1, THEN: /*door state = open*/\n      PRINT[CELL(0), '   '];\n    \n    CELL(0) <= CELL(0) + 1;\n\n  BLOCK 1: END;\nBLOCK 0: END.\n\nDOORS[100];",
100        "safe": true
101    },
102    {
103        "filename": "100 doors_117.txt",
104        "content": " > 1   \n > 4   \n > 9   \n > 16   \n > 25   \n > 36   \n > 49   \n > 64   \n > 81   \n > 100   \n",
105        "safe": true
106    },
107    {
108        "filename": "100 doors_118.txt",
109        "content": "( 100doors-tbl\n=   door step\n  .   tbl$(doors.101) { Create an array. Indexing is 0-based. Add one extra for addressing element nr. 100 }\n    & 0:?step\n    &   whl\n      ' ( 1+!step:~>100:?step   { ~> means 'not greater than', i.e. 'less than or equal' }\n        & 0:?door\n        &   whl\n          ' ( !step+!door:~>100:?door\n            & 1+-1*!(!door$doors):?doors  { <number>$<variable> sets the current index, which stays the same until explicitly changed. }\n            )\n        )\n    & 0:?door\n    &   whl\n      ' ( 1+!door:~>100:?door\n        &   out\n          $ ( door\n              !door\n              is\n              (\u00a0!(!door$doors):1&open\n              | closed\n              )\n            )\n        )\n    & tbl$(doors.0)  { clean up the array }\n)",
110        "safe": true
111    },
112    {
113        "filename": "100 doors_119.txt",
114        "content": "( 100doors-var\n=   step door\n  .   0:?door\n    &   whl\n      ' ( 1+!door:~>100:?door\n        & closed:?!door { this creates a variable and assigns a value 'closed' to it }\n        )\n    & 0:?step\n    &   whl\n      ' ( 1+!step:~>100:?step\n        & 0:?door\n        &   whl\n          ' ( !step+!door:~>100:?door\n            &   (\u00a0!!door:closed&open\n                | closed\n                )\n             \u00a0:\u00a0?!door   \n            )\n        )\n    & 0:?door\n    &   whl\n      ' ( 1+!door:~>100:?door\n        & out$(door !door is\u00a0!!door)\n        )\n    & 0:?door\n    &   whl\n      ' ( 1+!door:~>100:?door\n        & tbl$(!door.0)         { cleanup the variable }\n        )\n)",
115        "safe": true
116    },
117    {
118        "filename": "100 doors_12.txt",
119        "content": "\\ Array of doors; init to empty; accessing a non-extant member will return\n\\ 'null', which is treated as 'false', so we don't need to initialize it:\n[] var, doors    \n\n\\ given a door number, get the value and toggle it:\n: toggle-door \\ n --\n\tdoors @ over a:@\n\tnot rot swap a:! drop ;\n\n\\ print which doors are open:\n: .doors\n\t( \n\t\tdoors @ over a:@ nip\n\t\tif . space else drop then\n\t) 1 100 loop ;\n\n\\ iterate over the doors, skipping 'n':\n: main-pass \\ n --\n\t0\n\ttrue\n\trepeat\n\t\tdrop\n\t\tdup toggle-door\n\t\tover n:+\n\t\tdup 101 <\n\twhile 2drop drop ;\n\n\\ calculate the first 100 doors:\n' main-pass 1 100 loop\n\\ print the results:\n.doors cr bye\n",
120        "safe": true
121    },
122    {
123        "filename": "100 doors_120.txt",
124        "content": "( 100doors-list\n=   doors door doorIndex step\n  .  \u00a0:?doors\n    & 0:?door\n    &   whl\n      ' ( 1+!door:~>100:?door\n        & closed !doors:?doors\n        )\n    & 0:?skip\n    &   whl\n      ' (\u00a0:?ndoors\n        &   whl\n          ' ( !doors:?skipped [!skip\u00a0%?door ?doors  { the [<number> pattern only succeeds when the scanning cursor is at position <number> }\n            &     !ndoors\n                  !skipped\n                  ( !door:open&closed\n                  | open\n                  )\n             \u00a0: ?ndoors\n            )\n        & !ndoors !doors:?doors\n        & 1+!skip:<100:?skip\n        )\n    & out$!doors\n)",
125        "safe": true
126    },
127    {
128        "filename": "100 doors_121.txt",
129        "content": "( 100doors-obj\n=   doors door doorIndex step\n  .  \u00a0:?doors\n    & 0:?door\n    &   whl\n      ' ( 1+!door:~>100:?door\n        & new$(=closed) !doors:?doors\n        )\n    & 0:?skip\n    &   whl\n      ' ( !doors:?tododoors\n        &   whl\n          ' ( !tododoors:? [!skip\u00a0%?door ?tododoors\n            &   (\u00a0!(door.):open&closed\n                | open\n                )\n             \u00a0:\u00a0?(door.)\n            )\n        & 1+!skip:<100:?skip\n        )\n    & out$!doors\n)",
130        "safe": true
131    },
132    {
133        "filename": "100 doors_122.txt",
134        "content": "100doors-tbl$\n& 100doors-var$\n& 100doors-list$\n& 100doors-obj$;",
135        "safe": true
136    },
137    {
138        "filename": "100 doors_123.txt",
139        "content": "blsq ) 10ro2?^\n{1 4 9 16 25 36 49 64 81 100}",
140        "safe": true
141    },
142    {
143        "filename": "100 doors_124.txt",
144        "content": "swch \u2190 \u2260\u00b4{100\u294a1\u00ab\ud835\udd69\u294a0}\u00a81+\u2195100\n\u00af1\u2193\u223e{\ud835\udd69\u223e@+10}\u00a8\u2022Fmt\u00a8\u27e8swch,/swch\u27e9\n",
145        "safe": true
146    },
147    {
148        "filename": "100 doors_125.txt",
149        "content": "\"\u27e8 1 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 \u27e9\n\u27e8 0 3 8 15 24 35 48 63 80 99 \u27e9\"\n",
150        "safe": true
151    },
152    {
153        "filename": "100 doors_126.txt",
154        "content": "swch\n",
155        "safe": true
156    },
157    {
158        "filename": "100 doors_127.txt",
159        "content": "#include <stdio.h>\n\nint main()\n{\n  char is_open[100] = { 0 };\n  int pass, door;\n\n  /* do the 100 passes */\n  for (pass = 0; pass < 100; ++pass)\n    for (door = pass; door < 100; door += pass+1)\n      is_open[door] = !is_open[door];\n\n  /* output the result */\n  for (door = 0; door < 100; ++door)\n    printf(\"door #%d is %s.\\n\", door+1, (is_open[door]? \"open\" : \"closed\"));\n\n  return 0;\n}\n",
160        "safe": true
161    },
162    {
163        "filename": "100 doors_128.txt",
164        "content": "#include <stdio.h>\n\n#define NUM_DOORS 100\n\nint main(int argc, char *argv[])\n{\n  int is_open[NUM_DOORS] = { 0 } ;\n  int * doorptr, * doorlimit = is_open + NUM_DOORS ;\n  int pass ;\n\n  /* do the N passes, go backwards because the order is not important */\n  for ( pass= NUM_DOORS ; ( pass ) ; -- pass ) {\n    for ( doorptr= is_open + ( pass-1 ); ( doorptr < doorlimit ) ; doorptr += pass ) {\n      ( * doorptr ) ^= 1 ;\n    }\n  }\n\n  /* output results */\n  for ( doorptr= is_open ; ( doorptr != doorlimit ) ; ++ doorptr ) {\n    printf(\"door #%lld is %s\\n\", ( doorptr - is_open ) + 1, ( * doorptr ) ? \"open\" : \"closed\" ) ;\n  }\n}\n",
165        "safe": true
166    },
167    {
168        "filename": "100 doors_129.txt",
169        "content": "#include <stdio.h>\n\nint main()\n{\n  int square = 1, increment = 3, door;\n  for (door = 1; door <= 100; ++door)\n  {\n    printf(\"door #%d\", door);\n    if (door == square)\n    {\n      printf(\" is open.\\n\");\n      square += increment;\n      increment += 2;\n    }\n    else\n      printf(\" is closed.\\n\");\n  }\n  return 0;\n}\n",
170        "safe": true
171    },
172    {
173        "filename": "100 doors_13.txt",
174        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program 100doors64.s   */\n \n/*******************************************/\n/* Constantes file                         */\n/*******************************************/\n/* for this file see task include a file in language AArch64 assembly*/\n.include \"../includeConstantesARM64.inc\"\n\n.equ NBDOORS,   100\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:       .asciz \"The door @ is open.\\n\"\n \n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss  \nstTableDoors:    .skip   8 * NBDOORS\nsZoneConv:       .skip 24\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                             // entry of program \n    // display first line\n    ldr x3,qAdrstTableDoors       // table address\n    mov x5,1             \n1:\n    mov x4,x5\n2:                               // begin loop\n    ldr x2,[x3,x4,lsl #3]        // read doors index x4\n    cmp x2,#0\n    cset x2,eq\n    //moveq x2,#1                // if x2 = 0   1 -> x2\n    //movne x2,#0                // if x2 = 1   0 -> x2\n    str x2,[x3,x4,lsl #3]        // store value of doors\n    add x4,x4,x5                 // increment x4 with  x5 value\n    cmp x4,NBDOORS               // number of doors\u00a0?\n    ble 2b                       // no -> loop\n    add x5,x5,#1                 // increment the increment\u00a0!!\n    cmp x5,NBDOORS               // number of doors\u00a0?\n    ble 1b                       // no -> loop\n \n                                 // loop display state doors\n    mov x4,#0              \n3:\n    ldr x2,[x3,x4,lsl #3]        // read state doors x4 index\n    cmp x2,#0\n    beq 4f\n    mov x0,x4                    // open -> display message\n    ldr x1,qAdrsZoneConv          // display value index\n    bl conversion10              // call function\n    ldr x0,qAdrsMessResult\n    ldr x1,qAdrsZoneConv \n    bl strInsertAtCharInc        // insert result at first @ character\n    bl affichageMess             // display message\n4:\n    add x4,x4,1\n    cmp x4,NBDOORS\n    ble 3b                       // loop\n \n \n100:                             // standard end of the program \n    mov x0,0                     // return code\n    mov x8,EXIT                  // request to exit program\n    svc 0                        // perform the system call\n \nqAdrstTableDoors:        .quad stTableDoors\nqAdrsMessResult:         .quad sMessResult\nqAdrsZoneConv:           .quad sZoneConv\n/***********************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
175        "safe": true
176    },
177    {
178        "filename": "100 doors_130.txt",
179        "content": "#include <stdio.h>\n\nint main()\n{\n  int door, square, increment;\n  for (door = 1, square = 1, increment = 1; door <= 100; door++ == square && (square += increment += 2))\n    printf(\"door #%d is %s.\\n\", door, (door == square? \"open\" : \"closed\"));\n  return 0;\n}\n",
180        "safe": true
181    },
182    {
183        "filename": "100 doors_131.txt",
184        "content": "#include <stdio.h>\n\nint main()\n{\n\tint i;\n\tfor (i = 1; i * i <= 100; i++)\n\t\tprintf(\"door %d open\\n\", i * i);\n\n\treturn 0;\n}\n",
185        "safe": true
186    },
187    {
188        "filename": "100 doors_132.txt",
189        "content": "namespace ConsoleApplication1\n{\n    using System;\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            bool[] doors = new bool[100];\n\n            //Close all doors to start.\n            for (int d = 0; d < 100; d++) doors[d] = false;\n\n            //For each pass...\n            for (int p = 0; p < 100; p++)//number of passes\n            {\n                //For each door to toggle...\n                for (int d = 0; d < 100; d++)//door number\n                {\n                    if ((d + 1) % (p + 1) == 0)\n                    {\n                        doors[d] = !doors[d];\n                    }\n                }\n            }\n\n            //Output the results.\n            Console.WriteLine(\"Passes Completed!!!  Here are the results: \\r\\n\");\n            for (int d = 0; d < 100; d++)\n            {\n                if (doors[d])\n                {\n                    Console.WriteLine(String.Format(\"Door #{0}: Open\", d + 1));\n                }\n                else\n                {\n                    Console.WriteLine(String.Format(\"Door #{0}: Closed\", d + 1));\n                }\n            }\n            Console.ReadKey(true);\n        }\n    }\n}\n",
190        "safe": true
191    },
192    {
193        "filename": "100 doors_133.txt",
194        "content": "namespace ConsoleApplication1\n{\n    using System;\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            //Perform the operation.\n            bool[] doors = new bool[100];\n            int n = 0;\n            int d;\n            while ((d = (++n * n)) <= 100)\n                doors[d - 1] = true;\n\n            //Perform the presentation.\n            for (d = 0; d < doors.Length; d++)\n                Console.WriteLine(\"Door #{0}: {1}\", d + 1, doors[d] ? \"Open\" : \"Closed\");\n            Console.ReadKey(true);\n        }\n    }\n}\n",
195        "safe": true
196    },
197    {
198        "filename": "100 doors_134.txt",
199        "content": "namespace ConsoleApplication1\n{\n    using System;\n    class Program\n    {\n        static void Main()\n        {\n            bool[] doors = new bool[100];\n\n            //The number of passes can be 1-based, but the number of doors must be 0-based.\n            for (int p = 1; p <= 100; p++)\n                for (int d = p - 1; d < 100; d += p)\n                    doors[d] = !doors[d];\n            for (int d = 0; d < 100; d++)\n                Console.WriteLine(\"Door #{0}: {1}\", d + 1, doors[d] ? \"Open\" : \"Closed\");\n            Console.ReadKey(true);\n        }\n    }\n}\n",
200        "safe": true
201    },
202    {
203        "filename": "100 doors_135.txt",
204        "content": "namespace ConsoleApplication1\n{\n    using System;\n    class Program\n    {\n        static void Main()\n        {\n            double n;\n\n            //If the current door number is the perfect square of an integer, say it is open, else say it is closed.\n            for (int d = 1; d <= 100; d++)\n                Console.WriteLine(\"Door #{0}: {1}\", d, (n = Math.Sqrt(d)) == (int)n ? \"Open\" : \"Closed\");\n            Console.ReadKey(true);\n        }\n    }\n}\n",
205        "safe": true
206    },
207    {
208        "filename": "100 doors_136.txt",
209        "content": "using System;\nusing System.IO;\nusing System.Collections.Generic;\n\nclass Program\n{\n    static void Main()\n    {\n        Console.Clear();\n        Console.WriteLine(\"Input a number of doors to calculate, then press enter\");\n        StartCalculator();\n    }\n    \n    static void StartCalculator()\n    {\n        //The number to calculate is input here\n        string input = Console.ReadLine();\n        Console.Clear();\n        \n        try\n        {\n            //The program attempts to convert the string to an int\n            //Exceptions will be caught on this line\n            int numberOfDoors = Convert.ToInt32(input);\n            \n            //Will call method recursively if input number is less than 1\n            if (numberOfDoors <= 0)\n            {\n                Console.WriteLine(\"Please use a number greater than 0\");\n                StartCalculator();\n            }\n            \n            //The program then starts the calculation process\n            Calculate(numberOfDoors);\n            \n            //After calculation process is finished, restart method is called\n            RestartCalculator();\n        }\n        catch(FormatException)\n        {\n            //Code will be executed if the number has a decimal or has an unrecognizable symbol\n            Console.WriteLine(\"Unable to read. Please use a real number without a decimal\");\n            StartCalculator();\n        }\n        catch (OverflowException)\n        {\n            //Code will be executed if number is too long\n            Console.WriteLine(\"You number is too long\");\n            StartCalculator();\n        }\n    }\n    \n    static void Calculate(int numberOfDoors)\n    {\n        //Increases numberOfDoors by 1 since array starts at 0\n        numberOfDoors++;\n        \n        //Dictionary key represents door number, value represents if the door is open\n        //if value == true, the door is open\n        Dictionary<int, bool> doors = new Dictionary<int, bool>();\n        \n        //Creates Dictionary size of numberOfDoors, all initialized at false\n        for(int i = 0; i < numberOfDoors; i++)\n        {\n            doors.Add(i, false);\n        }\n        \n        //Creates interval between doors, starting at 0, while less than numberOfDoors\n        for (int doorInterval = 0; doorInterval < numberOfDoors; doorInterval++)\n        {\n            //Will alter every cubby at doorInterval\n            //1 needs to be added since doorInterval will start at 0 and end when equal to numberOfDoors\n            for(int i = 0; i < numberOfDoors; i += doorInterval + 1)\n            {\n                //Changes a false value to true and vice versa\n                doors[i] = doors[i] ? false: true;\n            }\n        }\n        \n        //Writes each door and whether it is open or closed\n        for(int i = 0; i < numberOfDoors; i++)\n        {\n            //Skips over door 0\n            if (i == 0) continue;\n            //Writes open if door value is true, writes closed if door value is false\n            Console.WriteLine(\"Door \" + (i) + \" is \" + (doors[i] ? \"open\" : \"closed\"));\n        }\n    }\n    \n    static void RestartCalculator()\n    {   \n        Console.WriteLine(\"Press any key to restart\");\n        Console.ReadKey(true);\n        Main();\n    }\n}\n",
210        "safe": true
211    },
212    {
213        "filename": "100 doors_137.txt",
214        "content": "#include <iostream>\n\nint main()\n{\n  bool is_open[100] = { false };\n\n  // do the 100 passes\n  for (int pass = 0; pass < 100; ++pass)\n    for (int door = pass; door < 100; door += pass+1)\n      is_open[door] = !is_open[door];\n\n  // output the result\n  for (int door = 0; door < 100; ++door)\n    std::cout << \"door #\" << door+1 << (is_open[door]? \" is open.\" : \" is closed.\") << std::endl;\n  return 0;\n}\n",
215        "safe": true
216    },
217    {
218        "filename": "100 doors_138.txt",
219        "content": "#include <iostream>\n\nint main()\n{\n  int square = 1, increment = 3;\n  for (int door = 1; door <= 100; ++door)\n  {\n    std::cout << \"door #\" << door;\n    if (door == square)\n    {\n      std::cout << \" is open.\" << std::endl;\n      square += increment;\n      increment += 2;\n    }\n    else\n      std::cout << \" is closed.\" << std::endl;\n  }\n  return 0;\n}\n",
220        "safe": true
221    },
222    {
223        "filename": "100 doors_139.txt",
224        "content": "#include <iostream> //compiled with \"Dev-C++\" , from RaptorOne\n\nint main()\n{\n    for(int i=1; i*i<=100; i++)\n            std::cout<<\"Door \"<<i*i<<\" is open!\"<<std::endl;\n}\n",
225        "safe": true
226    },
227    {
228        "filename": "100 doors_14.txt",
229        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program 100doors64_1.s   */\n \n/*******************************************/\n/* Constantes file                         */\n/*******************************************/\n/* for this file see task include a file in language AArch64 assembly*/\n.include \"../includeConstantesARM64.inc\"\n\n.equ NBDOORS,   100\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:       .asciz \"The door @ is open.\\n\"\n \n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss  \nsZoneConv:        .skip 24\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                             // entry of program \n \n    mov x5,3\n    mov x4,1\n1:\n    mov x0,x4\n    ldr x1,qAdrsZoneConv          // display value index\n    bl conversion10              // call function\n    ldr x0,qAdrsMessResult\n    ldr x1,qAdrsZoneConv \n    bl strInsertAtCharInc        // insert result at first @ character\n    bl affichageMess             // display message\n    add x4,x4,x5\n    add x5,x5,2\n    cmp x4,NBDOORS\n    ble 1b                       // loop\n \n \n100:                             // standard end of the program \n    mov x0,0                     // return code\n    mov x8,EXIT                  // request to exit program\n    svc 0                        // perform the system call\n \nqAdrsMessResult:         .quad sMessResult\nqAdrsZoneConv:           .quad sZoneConv\n/***********************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
230        "safe": true
231    },
232    {
233        "filename": "100 doors_140.txt",
234        "content": "#include <iostream>    // compiled with clang (tags/RELEASE_600/final)\n#include <type_traits> // or g++ (GCC) 7.3.1 20180406 -- from hare1039\nnamespace functional_list // basic building block for template meta programming\n{\nstruct NIL\n{\n\tusing head = NIL;\n\tusing tail = NIL;\n\tfriend std::ostream& operator << (std::ostream& os, NIL const) { return os; }\n};\n\ntemplate <typename H, typename T = NIL>\nstruct list\n{\n\tusing head = H;\n\tusing tail = T;\n};\n\ntemplate <int i>\nstruct integer\n{\n\tstatic constexpr int value = i;\n\tfriend std::ostream& operator << (std::ostream& os, integer<i> const) { os << integer<i>::value; return os;}\n};\n\ntemplate <typename L, int nTH> constexpr\nauto at()\n{\n\tif constexpr (nTH == 0)\n\t\treturn (typename L::head){};\n\telse if constexpr (not std::is_same_v<typename L::tail, NIL>) \n\t\treturn at<typename L::tail, nTH - 1>();\n\telse\n\t\treturn NIL{};\n}\ntemplate <typename L, int nTH>\nusing at_t = decltype(at<L, nTH>());\n\ntemplate <typename L, typename elem> constexpr\nauto prepend() { return list<elem, L>{}; }\n\ntemplate <typename L, typename elem>\nusing prepend_t = decltype(prepend<L, elem>());\n\t\ntemplate <int Size, typename Dat = integer<0>> constexpr\nauto gen_list()\n{\n\tif constexpr (Size == 0)\n\t\treturn NIL{};\n\telse\n\t{\n\t\tusing next = decltype(gen_list<Size - 1, Dat>());\n\t\treturn prepend<next, Dat>();\n\t}\n}\ntemplate <int Size, typename Dat = integer<0>>\nusing gen_list_t = decltype(gen_list<Size, Dat>());\n\t\n} namespace fl = functional_list;\n\nconstexpr int door_amount = 101; // index from 1 to 100\n\ntemplate <typename L, int current, int moder> constexpr\nauto construct_loop()\n{\n\tusing val_t = fl::at_t<L, current>;\n\tif constexpr (std::is_same_v<val_t, fl::NIL>)\n\t\treturn fl::NIL{};\n\telse\n\t{\n\t\tconstexpr int val = val_t::value;\n\t\tusing val_add_t = fl::integer<val + 1>;\n\t\tusing val_old_t = fl::integer<val>;\n\t\n\t\tif constexpr (current == door_amount)\n\t\t{\n\t\t\tif constexpr(current % moder == 0)\n\t\t\t\treturn fl::list<val_add_t>{};\n\t\t\telse\n\t\t\t\treturn fl::list<val_old_t>{};\n\t\t}\n\t\telse\n\t\t{\n\t\t\tusing sub_list = decltype(construct_loop<L, current + 1, moder>());\n\t\t\tif constexpr(current % moder == 0)\n\t\t\t\treturn fl::prepend<sub_list, val_add_t>();\n\t\t\telse\n\t\t\t\treturn fl::prepend<sub_list, val_old_t>();\n\t\t}\n\t}\n}\n\ntemplate <int iteration> constexpr\nauto construct()\n{\n\tif constexpr (iteration == 1) // door index = 1\n\t{\n\t\tusing l = fl::gen_list_t<door_amount>;\n\t\treturn construct_loop<l, 0, iteration>();\n\t}\n\telse\n\t{\n\t\tusing prev_iter_list = decltype(construct<iteration - 1>());\n\t\treturn construct_loop<prev_iter_list, 0, iteration>();\n\t}\n}\n\ntemplate <typename L, int pos> constexpr\nvoid show_ans()\n{\n\tif constexpr (std::is_same_v<typename L::head, fl::NIL>)\n\t\treturn;\n\telse\n\t{\n\t\tif constexpr (L::head::value % 2 == 1)\n\t\t\tstd::cout << \"Door \" << pos << \" is opened.\\n\";\n\t\tshow_ans<typename L::tail, pos + 1>();\n\t}\n}\n\nint main()\n{\n\tusing result = decltype(construct<100>());\n\tshow_ans<result, 0>();\n}\n",
235        "safe": true
236    },
237    {
238        "filename": "100 doors_141.txt",
239        "content": "100_doors\n",
240        "safe": true
241    },
242    {
243        "filename": "100 doors_142.txt",
244        "content": " for i=1:1:100 {\n\t set doors(i) = 0\n }\n for i=1:1:100 {\n\t for door=i:i:100 {\n\t\t  Set doors(door)='doors(door)\n\t }\n }\n for i = 1:1:100\n {\n\tif doors(i)=1 write i_\": open\",!\n }\n",
245        "safe": true
246    },
247    {
248        "filename": "100 doors_143.txt",
249        "content": "1: open\n4: open\n9: open\n16: open\n25: open\n36: open\n49: open\n64: open\n81: open\n100: open\n",
250        "safe": true
251    },
252    {
253        "filename": "100 doors_144.txt",
254        "content": "shared void run() {\n    print(\"Open doors (naive):     ``naive()``\n           Open doors (optimized): ``optimized()``\");\n    \n}\n\nshared {Integer*} naive(Integer count = 100) {\n    variable value doors = [ for (_ in 1..count) closed ];\n    for (step in 1..count) {\n        doors = [for (i->door in doors.indexed) let (index = i+1) if (step == 1 || step.divides(index)) then door.toggle() else door ];\n    }\n    return doors.indexesWhere((door) => door == opened).map(1.plusInteger);\n}\n\nshared {Integer*} optimized(Integer count = 100) =>\n        { for (i in 1..count) i*i }.takeWhile(count.notSmallerThan);\n\n\nshared abstract class Door(shared actual String string) of opened | closed {\n    shared formal Door toggle();\n}\nobject opened extends Door(\"opened\") { toggle() => closed; }\nobject closed extends Door(\"closed\") { toggle() => opened; }\n",
255        "safe": true
256    },
257    {
258        "filename": "100 doors_145.txt",
259        "content": "Open doors (naive):     { 1, 4, 9, 16, 25, 36, 49, 64, 81, 100 }\nOpen doors (optimized): { 1, 4, 9, 16, 25, 36, 49, 64, 81, 100 }",
260        "safe": true
261    },
262    {
263        "filename": "100 doors_146.txt",
264        "content": "    program\n\n    map\n    end\n\nMAX_DOOR_NUMBER         equate(100)\nCRLF                    equate('<13,10>')\n\nDoors                   byte,dim(MAX_DOOR_NUMBER)\nPass                    byte\nDoorNumber              byte\nDisplayString           cstring(2000)\n\nResultWindow            window('Result'),at(,,133,291),center,double,auto\n                            prompt('Door states:'),at(8,4),use(?PromptTitle)\n                            text,at(8,16,116,266),use(DisplayString),boxed,vscroll,font('Courier New',,,,CHARSET:ANSI),readonly\n                        end\n\n    code\n\n    Doors\u00a0:=: false\n    loop Pass = 1 to MAX_DOOR_NUMBER\n        loop DoorNumber = Pass to MAX_DOOR_NUMBER by Pass\n            Doors[DoorNumber] = choose(Doors[DoorNumber], false, true)\n        end\n    end\n\n    clear(DisplayString)\n    loop DoorNumber = 1 to MAX_DOOR_NUMBER\n        DisplayString = DisplayString & format(DoorNumber, @n3) & ' is ' & choose(Doors[DoorNumber], 'opened', 'closed') & CRLF\n    end\n    open(ResultWindow)\n    accept\n    end\n    close(ResultWindow)\n\n    return",
265        "safe": true
266    },
267    {
268        "filename": "100 doors_147.txt",
269        "content": "fn visit-doors doors step:\n  if step > 100: doors\n  else:\n    [1:100]\n      -> * fn index:\n            if index\u00a0% step: doors[(index - 1)]\n            else: not doors[(index - 1)]\n      -> visit-doors (step + 1)\n\n[1:100] -> * n: false -> visit-doors 1 => doors\n[1:100] -> * (@eager) fn i:\n  doors[(i - 1)]\n    -> if = true: #open\n            else: #closed\n    -> print #Door i #is @",
270        "safe": true
271    },
272    {
273        "filename": "100 doors_148.txt",
274        "content": "[1:100] -> * (@eager) fn i:\n  i ^ 0.5\n    -> eq @ (transform i: floor)\n    -> if = true: #open\n            else: #closed\n    -> print #Door i #is @",
275        "safe": true
276    },
277    {
278        "filename": "100 doors_149.txt",
279        "content": "(deffacts initial-state\n  (door-count 100)\n)\n\n(deffunction toggle\n  (?state)\n  (switch ?state\n    (case \"open\" then \"closed\")\n    (case \"closed\" then \"open\")\n  )\n)\n\n(defrule create-doors-and-visits\n  (door-count ?count)\n  =>\n  (loop-for-count (?num 1 ?count) do\n    (assert (door ?num \"closed\"))\n    (assert (visit-from ?num ?num))\n  )\n  (assert (doors initialized))\n)\n\n(defrule visit\n  (door-count ?max)\n  ?visit <- (visit-from ?num ?step)\n  ?door <- (door ?num ?state)\n  =>\n  (retract ?visit)\n  (retract ?door)\n  (assert (door ?num (toggle ?state)))\n  (if\n    (<= (+ ?num ?step) ?max)\n    then\n    (assert (visit-from (+ ?num ?step) ?step))\n  )\n)\n\n(defrule start-printing\n  (doors initialized)\n  (not (visit-from\u00a0?\u00a0?))\n  =>\n  (printout t \"These doors are open:\" crlf)\n  (assert (print-from 1))\n)\n\n(defrule print-door\n  (door-count ?max)\n  ?pf <- (print-from ?num)\n  (door ?num ?state)\n  =>\n  (retract ?pf)\n  (if\n    (= 0 (str-compare \"open\" ?state))\n    then\n    (printout t ?num \" \")\n  )\n  (if\n    (< ?num ?max)\n    then\n    (assert (print-from (+ ?num 1)))\n    else\n    (printout t crlf \"All other doors are closed.\" crlf)\n  )\n)",
280        "safe": true
281    },
282    {
283        "filename": "100 doors_15.txt",
284        "content": "form open_doors_unopt.\n  data: lv_door  type i,\n        lv_count type i value 1.\n  data: lt_doors type standard table of c initial size 100.\n  field-symbols: <wa_door> type c.\n  do 100 times.\n    append initial line to lt_doors assigning <wa_door>.\n    <wa_door> = 'X'.\n  enddo.\n\n  while lv_count < 100.\n    lv_count = lv_count + 1.\n    lv_door = lv_count.\n    while lv_door < 100.\n      read table lt_doors index lv_door assigning <wa_door>.\n      if <wa_door> = ' '.\n        <wa_door> = 'X'.\n      else.\n        <wa_door> = ' '.\n      endif.\n      add lv_count to lv_door.\n    endwhile.\n  endwhile.\n\n  loop at lt_doors assigning <wa_door>.\n    if <wa_door> = 'X'.\n      write : / 'Door', (4) sy-tabix right-justified, 'is open' no-gap.\n    endif.\n  endloop.\nendform.\n",
285        "safe": true
286    },
287    {
288        "filename": "100 doors_150.txt",
289        "content": "(deffacts initial-state\n  (door-count 100)\n)\n\n(deffunction is-square\n  (?num)\n  (= (sqrt ?num) (integer (sqrt ?num)))\n)\n\n(defrule check-doors\n  (door-count ?count)\n  =>\n  (printout t \"These doors are open:\" crlf)\n  (loop-for-count (?num 1 ?count) do\n    (if (is-square ?num) then\n      (printout t ?num \" \")\n    )\n  )\n  (printout t crlf \"All other doors are closed.\" crlf)\n)",
290        "safe": true
291    },
292    {
293        "filename": "100 doors_151.txt",
294        "content": "(defn doors []\n  (let [doors (into-array (repeat 100 false))]\n    (doseq [pass   (range 1 101) \n            i      (range (dec pass) 100 pass) ]\n      (aset doors i (not (aget doors i))))\n    doors))   \n\n(defn open-doors [] (for [[d n] (map vector (doors) (iterate inc 1)) :when d] n))\n\n(defn print-open-doors []\n  (println \n    \"Open doors after 100 passes:\"\n    (apply str (interpose \", \" (open-doors)))))\n",
295        "safe": true
296    },
297    {
298        "filename": "100 doors_152.txt",
299        "content": "(defn doors []\n  (reduce (fn [doors toggle-idx] (update-in doors [toggle-idx] not))\n          (into [] (repeat 100 false))\n          (for [pass   (range 1 101)\n                i      (range (dec pass) 100 pass) ]\n            i)))\n\n(defn open-doors [] (for [[d n] (map vector (doors) (iterate inc 1)) :when d] n))\n\n(defn print-open-doors []\n  (println \n    \"Open doors after 100 passes:\"\n    (apply str (interpose \", \" (open-doors)))))\n",
300        "safe": true
301    },
302    {
303        "filename": "100 doors_153.txt",
304        "content": "(defn open-doors []\n  (->> (for [step (range 1 101), occ (range step 101 step)] occ)\n       frequencies\n       (filter (comp odd? val))\n       keys\n       sort))\n\n(defn print-open-doors []\n  (println \n    \"Open doors after 100 passes:\"\n    (apply str (interpose \", \" (open-doors)))))\n",
305        "safe": true
306    },
307    {
308        "filename": "100 doors_154.txt",
309        "content": "(defn doors []\n\t(reduce (fn [doors idx] (assoc doors idx true)) \n\t        (into [] (repeat 100 false))\n\t        (map #(dec (* % %)) (range 1 11))))\n\n(defn open-doors [] (for [[d n] (map vector (doors) (iterate inc 1)) :when d] n))\n\n(defn print-open-doors []\n  (println \n    \"Open doors after 100 passes:\"\n    (apply str (interpose \", \" (open-doors)))))\n",
310        "safe": true
311    },
312    {
313        "filename": "100 doors_155.txt",
314        "content": "(defn open-doors [] (->> (iterate inc 1) (map #(* % %)) (take-while #(<= % 100))))\n\n(defn print-open-doors []\n  (println \n    \"Open doors after 100 passes:\"\n    (apply str (interpose \", \" (open-doors)))))\n",
315        "safe": true
316    },
317    {
318        "filename": "100 doors_156.txt",
319        "content": "start_up = proc ()\n    max = 100\n    po: stream\u00a0:= stream$primary_output()\n    open: array[bool]\u00a0:= array[bool]$fill(1, max, false)\n\n    for pass: int in int$from_to(1, max) do\n        for door: int in int$from_to_by(pass, max, pass) do\n            open[door]\u00a0:= ~open[door]\n        end\n    end\n\n    for door: int in array[bool]$indexes(open) do\n        if open[door] then\n            stream$putl(po, \"Door \" || int$unparse(door) || \" is open.\")\n        end\n    end\nend start_up",
320        "safe": true
321    },
322    {
323        "filename": "100 doors_157.txt",
324        "content": "Door 1 is open.\nDoor 4 is open.\nDoor 9 is open.\nDoor 16 is open.\nDoor 25 is open.\nDoor 36 is open.\nDoor 49 is open.\nDoor 64 is open.\nDoor 81 is open.\nDoor 100 is open.",
325        "safe": true
326    },
327    {
328        "filename": "100 doors_158.txt",
329        "content": "       IDENTIFICATION DIVISION.\n       PROGRAM-ID. 100Doors.\n\n       DATA DIVISION.\n       WORKING-STORAGE SECTION.\n       01 Current-n      PIC 9(3).\n       01 StepSize       PIC 9(3).\n       01 DoorTable.\n          02 Doors       PIC 9(1)   OCCURS 100 TIMES.\n             88 ClosedDoor          VALUE ZERO.\n       01 Idx            PIC 9(3).\n\n       PROCEDURE DIVISION.\n       Begin.\n           INITIALIZE DoorTable\n           PERFORM VARYING StepSize FROM 1 BY 1 UNTIL StepSize > 100\n             PERFORM VARYING Current-n FROM StepSize BY StepSize\n                     UNTIL Current-n > 100\n               SUBTRACT Doors (Current-n) FROM 1 GIVING Doors (Current-n)\n             END-PERFORM\n           END-PERFORM\n\n           PERFORM VARYING Idx FROM 1 BY 1\n                   UNTIL Idx > 100\n             IF ClosedDoor (Idx)\n               DISPLAY Idx \" is closed.\"\n             ELSE\n               DISPLAY Idx \" is open.\"\n             END-IF\n           END-PERFORM\n\n           STOP RUN\n           .\n",
330        "safe": true
331    },
332    {
333        "filename": "100 doors_159.txt",
334        "content": "doors = [false] * 100\n\nfor pass til doors.length\n    for i from pass til doors.length by pass + 1\n       \u00a0! = doors[i]\n\nfor i til doors.length\n    console.log 'Door %d is %s.', i + 1, if doors[i] then 'open' else 'closed'",
335        "safe": true
336    },
337    {
338        "filename": "100 doors_16.txt",
339        "content": "cl_demo_output=>display( REDUCE stringtab( INIT list TYPE stringtab\n                                              aux TYPE i\n                                          FOR door = 1 WHILE door <= 100\n                                          FOR pass = 1 WHILE pass <= 100\n                                         NEXT aux   = COND #( WHEN pass = 1 THEN 1\n                                                              WHEN door MOD pass = 0 THEN aux + 1 ELSE aux  )\n                                              list  = COND #( WHEN pass = 100\n                                                                THEN COND #( WHEN aux MOD 2 <> 0 THEN VALUE #( BASE list ( CONV #( door ) ) )\n                                                                              ELSE list ) ELSE list ) ) ).\n",
340        "safe": true
341    },
342    {
343        "filename": "100 doors_160.txt",
344        "content": "doors = []\n \nfor pass in [1..100]\n  for i in [pass..100] by pass\n    doors[i] = !doors[i]\n \nconsole.log \"Doors #{index for index, open of doors when open} are open\"\n \n# matrix output\nconsole.log doors.map (open) -> +open\n",
345        "safe": true
346    },
347    {
348        "filename": "100 doors_161.txt",
349        "content": "isInteger = (i) -> Math.floor(i) == i\n\nconsole.log door for door in [1..100] when isInteger Math.sqrt door\n",
350        "safe": true
351    },
352    {
353        "filename": "100 doors_162.txt",
354        "content": "console.log Math.pow(i,2) for i in [1..10]\n",
355        "safe": true
356    },
357    {
358        "filename": "100 doors_163.txt",
359        "content": "\tdoorCount = 1;\n\tdoorList = \"\";\n\t// create all doors and set all doors to open\n\twhile (doorCount LTE 100) {\n\t\tdoorList = ListAppend(doorList,\"1\");\n\t\tdoorCount = doorCount + 1;\n\t}\n\tloopCount = 2;\n\tdoorListLen = ListLen(doorList);\n\twhile (loopCount LTE 100) {\n\t\tloopDoorListCount = 1;\n\t\twhile (loopDoorListCount LTE 100) {\n\t\t\ttestDoor = loopDoorListCount / loopCount;\n\t\t\tif (testDoor EQ Int(testDoor)) {\n\t\t\t\tcheckOpen = ListGetAt(doorList,loopDoorListCount);\n\t\t\t\tif (checkOpen EQ 1) {\n\t\t\t\t\tdoorList = ListSetAt(doorList,loopDoorListCount,\"0\");\n\t\t\t\t} else {\n\t\t\t\t\tdoorList = ListSetAt(doorList,loopDoorListCount,\"1\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tloopDoorListCount = loopDoorListCount + 1;\n\t\t}\n\t\tloopCount = loopCount + 1;\n\t}",
360        "safe": true
361    },
362    {
363        "filename": "100 doors_164.txt",
364        "content": "\tdoorCount = 1;\n\tdoorList = \"\";\n\tloopCount = 1;\n\twhile (loopCount LTE 100) {\n\t\tif (Sqr(loopCount) NEQ Int(Sqr(loopCount))) {\n\t\t\tdoorList = ListAppend(doorList,0);\n\t\t} else {\n\t\t\tdoorList = ListAppend(doorList,1);\n\t\t}\n\t\tloopCount = loopCount + 1;\n\t}",
365        "safe": true
366    },
367    {
368        "filename": "100 doors_165.txt",
369        "content": "// Display all doors\n<cfloop from=\"1\" to=\"100\" index=\"x\">\n    Door #x# Open: #YesNoFormat(ListGetAt(doorList,x))#<br />\n</cfloop>\n\n// Output only open doors\n<cfloop from=\"1\" to=\"100\" index=\"x\">\n    <cfif ListGetAt(doorList,x) EQ 1>\n        #x#<br />\n    </cfif>\n</cfloop>\n",
370        "safe": true
371    },
372    {
373        "filename": "100 doors_166.txt",
374        "content": "<Cfparam name=\"doorlist\" default=\"\">\n<cfloop from=\"1\" to=\"100\" index=\"i\">\n    <Cfset doorlist = doorlist & 'c,'>\n</cfloop>\n<cfloop from=\"1\" to=\"100\" index=\"i\">\n    <Cfloop from=\"1\" to=\"100\" index=\"door\" step=\"#i#\">\n    <Cfif listgetat(doorlist, door) eq 'c'>\n        <Cfset doorlist = listsetat(doorlist, door, 'O')>\n    <Cfelse>\n        <Cfset doorlist = listsetat(doorlist, door, 'c')>\n    </Cfif>\n    </Cfloop>\n</cfloop>\n<Cfoutput>#doorlist#</Cfoutput>\n",
375        "safe": true
376    },
377    {
378        "filename": "100 doors_167.txt",
379        "content": "0010 DIM doors#(100)\n0020 FOR pass#:=1 TO 100 DO\n0030   FOR door#:=pass# TO 100 STEP pass# DO doors#(door#):=NOT doors#(door#)\n0040 ENDFOR pass#\n0050 FOR door#:=1 TO 100 DO\n0060   IF doors#(door#) THEN PRINT \"Door \",door#,\" is open.\"\n0070 ENDFOR door#\n0080 END\n",
380        "safe": true
381    },
382    {
383        "filename": "100 doors_168.txt",
384        "content": "Door 1 is open.\nDoor 4 is open.\nDoor 9 is open.\nDoor 16 is open.\nDoor 25 is open.\nDoor 36 is open.\nDoor 49 is open.\nDoor 64 is open.\nDoor 81 is open.\nDoor 100 is open.",
385        "safe": true
386    },
387    {
388        "filename": "100 doors_169.txt",
389        "content": "10 D=100: DIMD(D): P=1\n20 PRINT CHR$(147);\"PASS: \";P\n22 FOR I=P TO D STEP P: D(I)=NOTD(I): NEXT\n30 IF P=100 THEN 40\n32 P=P+1: GOTO20\n40 PRINT: PRINT\"THE FOLLOWING DOORS ARE OPEN: \"\n42 FOR I=1 TO D: IF D(I)=-1 THEN PRINTI;\n44 NEXT\n",
390        "safe": true
391    },
392    {
393        "filename": "100 doors_17.txt",
394        "content": "form open_doors_opt.\n  data: lv_square type i value 1,\n        lv_inc    type i value 3.\n  data: lt_doors  type standard table of c initial size 100.\n  field-symbols: <wa_door> type c.\n  do 100 times.\n    append initial line to lt_doors assigning <wa_door>.\n    if sy-index = lv_square.\n      <wa_door> = 'X'.\n      add: lv_inc to lv_square, 2 to lv_inc.\n      write : / 'Door', (4) sy-index right-justified, 'is open' no-gap.\n    endif.\n  enddo.\nendform.\n",
395        "safe": true
396    },
397    {
398        "filename": "100 doors_170.txt",
399        "content": "(defun visit-door (doors doornum value1 value2)\n  \"visits a door, swapping the value1 to value2 or vice-versa\"\n  (let ((d (copy-list doors))\n        (n (- doornum 1)))\n    (if (eql  (nth n d) value1)\n        (setf (nth n d) value2)\n      (setf (nth n d) value1))\n    d))\n\n(defun visit-every (doors num iter value1 value2)\n  \"visits every 'num' door in the list\"\n  (if (> (* iter num) (length doors))\n      doors\n    (visit-every (visit-door doors (* num iter) value1 value2)\n                 num\n                 (+ 1 iter)\n                 value1\n                 value2)))\n\n(defun do-all-visits (doors cnt value1 value2)\n  \"Visits all doors changing the values accordingly\"\n  (if (< cnt 1)\n      doors\n    (do-all-visits (visit-every doors cnt 1 value1 value2)\n                   (- cnt 1)\n                   value1\n                   value2)))\n\n(defun print-doors (doors)\n  \"Pretty prints the doors list\"\n  (format T \"~{~A ~A ~A ~A ~A ~A ~A ~A ~A ~A~%~}~%\" doors))\n\n(defun start (&optional (size 100))\n  \"Start the program\"\n  (let* ((open \"_\")\n         (shut \"#\")\n         (doors (make-list size :initial-element shut)))\n    (print-doors (do-all-visits doors size open shut))))\n",
400        "safe": true
401    },
402    {
403        "filename": "100 doors_171.txt",
404        "content": "(define-modify-macro toggle () not)\n\n(defun 100-doors ()\n  (let ((doors (make-array 100)))\n    (dotimes (i 100)\n      (loop for j from i below 100 by (1+ i)\n\t do (toggle (svref doors j))))\n    (dotimes (i 100)\n      (format t \"door ~a: ~:[closed~;open~]~%\" (1+ i) (svref doors i)))))\n",
405        "safe": true
406    },
407    {
408        "filename": "100 doors_172.txt",
409        "content": "(defun doors (z &optional (w (make-list z)) (n 1))\n  (if (> n z) w (doors z (toggle w n z) (1+ n))))\n\n(defun toggle (w m z)\n  (loop for a in w for n from 1 to z\n        collect (if (zerop (mod n m)) (not a) a)))\n\n> (doors 100)\n(T NIL NIL T NIL NIL NIL NIL T NIL NIL NIL NIL NIL NIL T NIL NIL NIL NIL NIL\n NIL NIL NIL T NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL T NIL NIL NIL NIL NIL\n NIL NIL NIL NIL NIL NIL NIL T NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL\n NIL NIL T NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL T\n NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL T)\n",
410        "safe": true
411    },
412    {
413        "filename": "100 doors_173.txt",
414        "content": "(defun doors (n)\n  (loop for a from 1 to n collect\n        (zerop (mod (sqrt a) 1))))\n \n> (doors 100)\n(T NIL NIL T NIL NIL NIL NIL T NIL NIL NIL NIL NIL NIL T NIL NIL NIL NIL NIL\n NIL NIL NIL T NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL T NIL NIL NIL NIL NIL\n NIL NIL NIL NIL NIL NIL NIL T NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL\n NIL NIL T NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL T\n NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL T)\n",
415        "safe": true
416    },
417    {
418        "filename": "100 doors_174.txt",
419        "content": "(defun 100-doors ()\n  (let ((doors (make-array 100)))\n    (dotimes (i 10)\n      (setf (svref doors (* i i)) t))\n    (dotimes (i 100)\n      (format t \"door ~a: ~:[closed~;open~]~%\" (1+ i) (svref doors i)))))\n",
420        "safe": true
421    },
422    {
423        "filename": "100 doors_175.txt",
424        "content": "(defun perfect-square-list (n)                       \n  \"Generates a list of perfect squares from 0 up to n\"\n  (loop for i from 1 to (isqrt n) collect (expt i 2))) \n \n(defun print-doors (doors)\n  \"Pretty prints the doors list\"\n  (format T \"~{~A ~A ~A ~A ~A ~A ~A ~A ~A ~A~%~}~%\" doors))\n\n(defun open-door (doors num open)\n  \"Sets door at num to open\"\n  (setf (nth (- num 1) doors) open)) \n\n(defun visit-all (doors vlist open)\n  \"Visits and opens all the doors indicated in vlist\"\n  (dolist (dn vlist doors)\n    (open-door doors dn open)))\n\n(defun start2 (&optional (size 100))                        \n  \"Start the program\"\n  (print-doors\n   (visit-all (make-list size :initial-element '\\#)\n              (perfect-square-list size)\n              '_)))\n",
425        "safe": true
426    },
427    {
428        "filename": "100 doors_176.txt",
429        "content": "(let  ((i 0))\n    (mapcar (lambda (x)\n                (if (zerop (mod (sqrt (incf i)) 1))\n                    \"_\" \"#\"))\n            (make-list 100)))\n",
430        "safe": true
431    },
432    {
433        "filename": "100 doors_177.txt",
434        "content": "MODULE Doors100;\nIMPORT StdLog;\n\nPROCEDURE Do*;\nVAR\n\ti,j: INTEGER;\n\tclosed: ARRAY 101 OF BOOLEAN;\nBEGIN\n\t(* initialization of closed to true *)\n\tFOR i := 0 TO LEN(closed) - 1 DO closed[i] := TRUE END;\n\t(* process *)\n\tFOR i := 1 TO LEN(closed)  DO;\n\t\tj := 1;\n\t\tWHILE j < LEN(closed) DO\n\t\t\tIF j MOD i = 0 THEN closed[j] := ~closed[j] END;INC(j)\n\t\tEND\n\tEND;\n\t(* print results *)\n\ti := 1;\n\tWHILE  i < LEN(closed)  DO\n\t\tIF (i - 1) MOD 10 = 0 THEN StdLog.Ln END;\n\t\tIF closed[i] THEN StdLog.String(\"C \") ELSE StdLog.String(\"O \") END;\n\t\tINC(i) \n\tEND;\nEND Do;\nEND Doors100.\n",
435        "safe": true
436    },
437    {
438        "filename": "100 doors_178.txt",
439        "content": "O C C O C C C C O C \nC C C C C O C C C C \nC C C C O C C C C C \nC C C C C O C C C C \nC C C C C C C C O C \nC C C C C C C C C C \nC C C O C C C C C C \nC C C C C C C C C C \nO C C C C C C C C C \nC C C C C C C C C O \n",
440        "safe": true
441    },
442    {
443        "filename": "100 doors_179.txt",
444        "content": "Require Import List.\n\nFixpoint rep {A} (a : A) n :=\n  match n with\n    | O => nil\n    | S n' => a::(rep a n')\n  end.\n\nFixpoint flip (l : list bool) (n k : nat) : list bool :=\n  match l with\n    | nil => nil\n    | cons h t => match k with\n                | O => (negb h) :: (flip t n n)\n                | S k' => h :: (flip t n k')\n              end\n  end.\n\nDefinition flipeach l n := flip l n n.\n\nFixpoint flipwhile l n :=\n  match n with\n    | O => flipeach l 0\n    | S n' => flipwhile (flipeach l (S n')) n'\n  end.\n\nDefinition prison cells := flipwhile (rep false cells) cells.\n",
445        "safe": true
446    },
447    {
448        "filename": "100 doors_18.txt",
449        "content": "DO 10 TIMES.\n  DATA(val) = sy-index * sy-index.\n  WRITE: / val.\nENDDO.\n",
450        "safe": true
451    },
452    {
453        "filename": "100 doors_180.txt",
454        "content": "Require Import List.\n\nFixpoint prisoo' nd n k accu :=\n  match nd with\n    | O => rev accu\n    | S nd' => let ra := match k with\n                 | O => (true, S n, (n + n))\n                 | S k' => (false, n, k')\n               end in\n               prisoo' nd' (snd (fst ra)) (snd ra) ((fst (fst ra))::accu)\n  end.\n\nDefinition prisoo cells := prisoo' cells 1 0 nil.\n",
455        "safe": true
456    },
457    {
458        "filename": "100 doors_181.txt",
459        "content": "Goal prison 100 = prisoo 100. compute. reflexivity. Qed.",
460        "safe": true
461    },
462    {
463        "filename": "100 doors_182.txt",
464        "content": "Goal forall n, prison n = prisoo n. Abort.",
465        "safe": true
466    },
467    {
468        "filename": "100 doors_183.txt",
469        "content": "include \"cowgol.coh\";\n\nvar doors: uint8[101];  # one extra so we can start at 1\nvar pass: @indexof doors;\nvar door: @indexof doors;\n\nMemZero(&doors as [uint8], @bytesof doors);\n\npass\u00a0:= 1;\nwhile pass <= 100 loop\n    door\u00a0:= pass;\n    while door <= 100 loop\n        doors[door]\u00a0:= 1-doors[door];\n        door\u00a0:= door + pass;\n    end loop;\n    pass\u00a0:= pass + 1;\nend loop;\n\ndoor\u00a0:= 1;\nwhile door <= 100 loop\n    if doors[door] == 1 then\n        print_i8(door);\n        print(\" is open\\n\");\n    end if;\n    door\u00a0:= door + 1;\nend loop;",
470        "safe": true
471    },
472    {
473        "filename": "100 doors_184.txt",
474        "content": "1 is open\n4 is open\n9 is open\n16 is open\n25 is open\n36 is open\n49 is open\n64 is open\n81 is open\n100 is open",
475        "safe": true
476    },
477    {
478        "filename": "100 doors_185.txt",
479        "content": "do\n\n\tlet i = i + 1\n\tprint i * i, \" \",\n\nloop i * i < 100",
480        "safe": true
481    },
482    {
483        "filename": "100 doors_186.txt",
484        "content": "1 4 9 16 25 36 49 64 81 100 ",
485        "safe": true
486    },
487    {
488        "filename": "100 doors_187.txt",
489        "content": "doors = Array.new(100, false)\n\n1.upto(100) do |i|\n  i.step(by: i, to: 100) do |j|\n    doors[j - 1] = !doors[j - 1]\n  end\nend\n\ndoors.each_with_index do |open, i|\n  puts \"Door #{i + 1} is #{open\u00a0? \"open\"\u00a0: \"closed\"}\"\nend",
490        "safe": true
491    },
492    {
493        "filename": "100 doors_188.txt",
494        "content": "import std.stdio;\nconst N = 101; // #doors + 1\nvoid main() {\n  bool[N] doors = false;\n  for(auto door=1; door<N; door++ ) {\n    for(auto i=door; i<N; i+=door ) doors[i] = !doors[i];\n    if (doors[door]) write(door, \" \");\n  }\n}",
495        "safe": true
496    },
497    {
498        "filename": "100 doors_189.txt",
499        "content": "1 4 9 16 25 36 49 64 81 100 ",
500        "safe": true
501    },
502    {
503        "filename": "100 doors_19.txt",
504        "content": "cl_demo_output=>display( REDUCE stringtab( INIT list TYPE stringtab\n                                          FOR i = 1 WHILE i <= 10\n                                         NEXT list = VALUE #( BASE list ( i * i ) ) ) ).\n",
505        "safe": true
506    },
507    {
508        "filename": "100 doors_190.txt",
509        "content": "import std.stdio;\nconst N = 101; // #doors + 1\nvoid main() {\n  for( auto door=1,s=3; door<N; door+=s, s+=2 )\n    write(door, \" \");\n}",
510        "safe": true
511    },
512    {
513        "filename": "100 doors_191.txt",
514        "content": "1 4 9 16 25 36 49 64 81 100 ",
515        "safe": true
516    },
517    {
518        "filename": "100 doors_192.txt",
519        "content": "import std.stdio, std.algorithm, std.range;\n\nenum DoorState\u00a0: bool { closed, open }\nalias Doors = DoorState[];\n\nDoors flipUnoptimized(Doors doors) pure nothrow {\n    doors[] = DoorState.closed;\n\n    foreach (immutable i; 0 .. doors.length)\n        for (ulong j = i; j < doors.length; j += i + 1)\n            if (doors[j] == DoorState.open)\n                doors[j] = DoorState.closed;\n            else\n                doors[j] = DoorState.open;\n    return doors;\n}\n\nDoors flipOptimized(Doors doors) pure nothrow {\n    doors[] = DoorState.closed;\n    for (int i = 1; i ^^ 2 <= doors.length; i++)\n        doors[i ^^ 2 - 1] = DoorState.open;\n    return doors;\n}\n\nvoid main() {\n    auto doors = new Doors(100);\n\n    foreach (const open; [doors.dup.flipUnoptimized,\n                          doors.dup.flipOptimized])\n        iota(1, open.length + 1).filter!(i => open[i - 1]).writeln;\n}",
520        "safe": true
521    },
522    {
523        "filename": "100 doors_193.txt",
524        "content": "[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]\n[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
525        "safe": true
526    },
527    {
528        "filename": "100 doors_194.txt",
529        "content": "import std.stdio;\n\nvoid printAllDoors(bool[] doors)\n{\n   // Prints the state of all the doors\n   foreach(i, door; doors)\n   {\n      writeln(\"#: \", i + 1, (door)\u00a0? \" open\"\u00a0: \" closed\");\n      }\n}\nvoid main()\n{\n   bool[100] doors = false;   //Create 100 closed doors\n   for(int a = 0; a < 100; ++a) {\n      writefln(\"Pass #%s; visiting every %s door.\", a + 1, a + 1);  // Optional\n\t for(int i = a; i < 100; i += (a + 1)) {\n\t writefln(\"Visited door %s\", i + 1);  //Optional\n\t doors[i] = !doors[i];\n\t }\n      writeln();  // Optional\n      }\n   printAllDoors(doors);   // Prints the state of each door\n}",
530        "safe": true
531    },
532    {
533        "filename": "100 doors_195.txt",
534        "content": "datatype Door = Closed | Open\n\nmethod InitializeDoors(n:int) returns (doors:array<Door>)\n  // Precondition: n must be a valid array size.\n  requires n >= 0\n  // Postcondition: doors is an array, which is not an alias for any other\n  // object, with a length of n, all of whose elements are Closed. The \"fresh\"\n  // (non-alias) condition is needed to allow doors to be modified by the\n  // remaining code.\n  ensures doors\u00a0!= null && fresh(doors) && doors.Length == n\n  ensures forall j\u00a0:: 0 <= j < doors.Length ==> doors[j] == Closed;\n{\n  doors\u00a0:= new Door[n];\n  var i\u00a0:= 0;\n  // Invariant: i is always a valid index inside the loop, and all doors less\n  // than i are Closed. These invariants are needed to ensure the second\n  // postcondition.\n  while i < doors.Length\n    invariant i <= doors.Length\n    invariant forall j\u00a0:: 0 <= j < i ==> doors[j] == Closed;\n  {\n    doors[i]\u00a0:= Closed;\n    i\u00a0:= i + 1;\n  }\n}\n\nmethod Main ()\n{\n  var doors\u00a0:= InitializeDoors(100);\n\n  var pass\u00a0:= 1;\n  while pass <= doors.Length\n  {\n    var door\u00a0:= pass;\n    while door < doors.Length\n    {\n      doors[door]\u00a0:= if doors[door] == Closed then Open else Closed;\n      door\u00a0:= door + pass;\n    }\n    pass\u00a0:= pass + 1;\n  }\n  var i\u00a0:= 0;\n  while i < doors.Length\n  {\n    print i, \" is \", if doors[i] == Closed then \"closed\\n\" else \"open\\n\";\n    i\u00a0:= i + 1;\n  }\n}",
535        "safe": true
536    },
537    {
538        "filename": "100 doors_196.txt",
539        "content": "main() {\n    for (var k = 1, x = new List(101); k <= 100; k++) {\n        for (int i = k; i <= 100; i += k)\n            x[i] = !x[i];\n        if (x[k]) print(\"$k open\");\n    }\n}",
540        "safe": true
541    },
542    {
543        "filename": "100 doors_197.txt",
544        "content": "main() {\n  for(int i=1,s=3;i<=100;i+=s,s+=2)\n    print(\"door $i is open\");\n}",
545        "safe": true
546    },
547    {
548        "filename": "100 doors_198.txt",
549        "content": "import 'dart:io';\n\nfinal numDoors = 100;\nfinal List<bool> doorClosed = List(numDoors);\n\nString stateToString(String message) {\n  var res = '';\n  for (var i = 0; i < numDoors; i++) {\n    res += (doorClosed[i]\u00a0? 'X'\u00a0: '\\u2610');\n  }\n  return res + \" \" + message;\n}\n\nmain() {\n  for (var i = 0; i < numDoors; i++) {\n    doorClosed[i] = true;\n  }\n  stdout.writeln(stateToString(\"after initialization\"));\n  for (var step = 1; step <= numDoors; step++) {\n    final start = step - 1;\n    for (var i = start; i < numDoors; i += step) {\n      doorClosed[i] = !doorClosed[i];\n    }\n    stdout.writeln(stateToString(\"after toggling with step = $step\"));\n  }\n}",
550        "safe": true
551    },
552    {
553        "filename": "100 doors_199.txt",
554        "content": "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX after initialization\n\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610 after toggling with step = 1\n\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X after toggling with step = 2\n\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX after toggling with step = 3\n\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XX\u2610 after toggling with step = 4\n\u2610XX\u2610X\u2610\u2610\u2610X\u2610\u2610X\u2610X\u2610\u2610\u2610\u2610\u2610XXX\u2610XXXX\u2610\u2610X\u2610\u2610XXXX\u2610XXX\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610\u2610X\u2610\u2610\u2610X\u2610XX\u2610\u2610\u2610XX\u2610X\u2610\u2610\u2610X\u2610\u2610X\u2610X\u2610\u2610\u2610\u2610\u2610XXX\u2610XXXX\u2610\u2610X\u2610\u2610XXXX\u2610XXX after toggling with step = 5\n\u2610XX\u2610XX\u2610\u2610X\u2610\u2610\u2610\u2610X\u2610\u2610\u2610X\u2610XXX\u2610\u2610XXX\u2610\u2610\u2610\u2610\u2610XXX\u2610\u2610XXX\u2610X\u2610\u2610\u2610X\u2610\u2610\u2610\u2610X\u2610\u2610XX\u2610XX\u2610X\u2610XX\u2610XX\u2610\u2610X\u2610\u2610\u2610\u2610X\u2610\u2610\u2610X\u2610XXX\u2610\u2610XXX\u2610\u2610\u2610\u2610\u2610XXX\u2610\u2610XXX after toggling with step = 6\n\u2610XX\u2610XXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610\u2610XXXX\u2610\u2610\u2610\u2610XX\u2610\u2610\u2610XXX\u2610\u2610\u2610\u2610\u2610X\u2610\u2610X\u2610X\u2610\u2610XXXXX\u2610X\u2610X\u2610\u2610XX\u2610\u2610XX\u2610\u2610\u2610X\u2610\u2610XX\u2610XXX\u2610XXXX\u2610\u2610\u2610X\u2610XXX\u2610\u2610\u2610XX after toggling with step = 7\n\u2610XX\u2610XXXXX\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610XXXXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XX\u2610\u2610\u2610\u2610\u2610\u2610X\u2610XX\u2610X\u2610\u2610XX\u2610XX\u2610X\u2610X\u2610XXX\u2610\u2610XX\u2610X\u2610X\u2610\u2610XX\u2610\u2610XX\u2610XXXXX\u2610\u2610X\u2610XXXX\u2610\u2610XX after toggling with step = 8\n\u2610XX\u2610XXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610X\u2610X\u2610XXX\u2610X\u2610\u2610\u2610XXX\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610XX\u2610X\u2610\u2610\u2610X\u2610XX\u2610X\u2610XXXXX\u2610\u2610XX\u2610\u2610\u2610X\u2610\u2610XX\u2610\u2610\u2610X\u2610XXXXX\u2610XX\u2610XXXX\u2610\u2610\u2610X after toggling with step = 9\n\u2610XX\u2610XXXX\u2610X\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610X\u2610XXX\u2610X\u2610X\u2610XXX\u2610X\u2610XXX\u2610\u2610\u2610\u2610XX\u2610XXXX\u2610\u2610\u2610X\u2610XX\u2610\u2610\u2610XXXXX\u2610\u2610X\u2610\u2610\u2610\u2610X\u2610\u2610XX\u2610X\u2610X\u2610XXXXX\u2610\u2610X\u2610XXXX\u2610\u2610\u2610\u2610 after toggling with step = 10\n\u2610XX\u2610XXXX\u2610XX\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610\u2610\u2610XXX\u2610XXXX\u2610\u2610\u2610\u2610\u2610XX\u2610\u2610\u2610XXXX\u2610\u2610\u2610X\u2610\u2610\u2610\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610XXXX\u2610\u2610\u2610X\u2610XXXX\u2610\u2610X\u2610 after toggling with step = 11\n\u2610XX\u2610XXXX\u2610XXX\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610XXX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XXXX\u2610\u2610\u2610X\u2610\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610\u2610XXX\u2610\u2610\u2610X\u2610XXX\u2610\u2610\u2610X\u2610 after toggling with step = 12\n\u2610XX\u2610XXXX\u2610XXXX\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610\u2610\u2610XXX\u2610\u2610XXXX\u2610\u2610\u2610\u2610XX\u2610X\u2610XXX\u2610\u2610\u2610\u2610X\u2610\u2610X\u2610X\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610\u2610XXX\u2610\u2610\u2610\u2610\u2610XXX\u2610\u2610\u2610X\u2610 after toggling with step = 13\n\u2610XX\u2610XXXX\u2610XXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610XXX\u2610\u2610XXXX\u2610\u2610\u2610XXX\u2610X\u2610XXX\u2610\u2610\u2610\u2610XX\u2610X\u2610X\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610XXXX\u2610\u2610\u2610\u2610\u2610XXX\u2610\u2610XX\u2610 after toggling with step = 14\n\u2610XX\u2610XXXX\u2610XXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610XXXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610\u2610XX\u2610X\u2610XX\u2610\u2610\u2610\u2610X\u2610X\u2610XXXX\u2610\u2610X\u2610\u2610XXX\u2610\u2610XX\u2610 after toggling with step = 15\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXXXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610\u2610X\u2610XXXX\u2610\u2610X\u2610\u2610XXXX\u2610XX\u2610 after toggling with step = 16\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610\u2610\u2610XXX\u2610\u2610\u2610XX\u2610\u2610\u2610\u2610XXX\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610XX\u2610\u2610X\u2610\u2610XXXX\u2610XX\u2610 after toggling with step = 17\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XX\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610XXX\u2610\u2610\u2610XX\u2610\u2610\u2610\u2610XXX\u2610\u2610\u2610XX\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610XXXX\u2610XX\u2610 after toggling with step = 18\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXX\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610XX\u2610\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XX\u2610 after toggling with step = 19\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXX\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XX\u2610\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610X\u2610X\u2610X\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XXX after toggling with step = 20\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXX\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610X\u2610X\u2610\u2610\u2610XX\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610XXX after toggling with step = 21\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXX\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610X\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610X\u2610X\u2610\u2610\u2610XXX\u2610\u2610\u2610\u2610XX\u2610X\u2610XXX after toggling with step = 22\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610\u2610\u2610XXX\u2610\u2610\u2610X\u2610X\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610X\u2610XXX after toggling with step = 23\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610\u2610\u2610X\u2610X\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX after toggling with step = 24\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XX\u2610 after toggling with step = 25\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XX\u2610 after toggling with step = 26\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XX\u2610 after toggling with step = 27\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610XXX\u2610\u2610\u2610XXX\u2610\u2610\u2610XX\u2610 after toggling with step = 28\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXX\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610\u2610\u2610XXX\u2610\u2610\u2610XX\u2610 after toggling with step = 29\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXX\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610\u2610\u2610XX\u2610 after toggling with step = 30\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXX\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610\u2610XX\u2610 after toggling with step = 31\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXX\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XX\u2610 after toggling with step = 32\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXX\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 33\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 34\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 35\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 36\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 37\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 38\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610XXX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 39\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610XX\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 40\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 41\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXX\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 42\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXX\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 43\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXX\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 44\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXX\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 45\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXX\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610X\u2610\u2610 after toggling with step = 46\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610X\u2610\u2610 after toggling with step = 47\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610 after toggling with step = 48\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610 after toggling with step = 49\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 50\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 51\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 52\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 53\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 54\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 55\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 56\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 57\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXX\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 58\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXX\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 59\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXX\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 60\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXX\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 61\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 62\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 63\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 64\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 65\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 66\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 67\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 68\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 69\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 70\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 71\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 72\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 73\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 74\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXX\u2610\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 75\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXX\u2610\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 76\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXX\u2610\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 77\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 78\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 79\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 80\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 81\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610X\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 82\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 83\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 84\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 85\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 86\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 87\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 88\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 89\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 90\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 91\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 92\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXXXXXX\u2610\u2610\u2610\u2610\u2610\u2610X after toggling with step = 93\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXXXXXXX\u2610\u2610\u2610\u2610\u2610X after toggling with step = 94\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610\u2610\u2610\u2610X after toggling with step = 95\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXX\u2610\u2610\u2610X after toggling with step = 96\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610\u2610X after toggling with step = 97\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXXX\u2610X after toggling with step = 98\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXXXXX after toggling with step = 99\n\u2610XX\u2610XXXX\u2610XXXXXX\u2610XXXXXXXX\u2610XXXXXXXXXX\u2610XXXXXXXXXXXX\u2610XXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXX\u2610XXXXXXXXXXXXXXXXXX\u2610 after toggling with step = 100",
555        "safe": true
556    },
557    {
558        "filename": "100 doors_2.txt",
559        "content": "*        100 doors                 13/08/2015\nHUNDOOR  CSECT\n         USING  HUNDOOR,R12\n         LR     R12,R15\n         LA     R6,0\n         LA     R8,1               step 1\n         LA     R9,100\nLOOPI    BXH    R6,R8,ELOOPI       do ipass=1 to 100 (R6)\n         LR     R7,R6\n         SR     R7,R6\n         LR     R10,R6             step ipass\n         LA     R11,100\nLOOPJ    BXH    R7,R10,ELOOPJ      do idoor=ipass to 100 by ipass (R7)\n         LA     R5,DOORS-1\n         AR     R5,R7\n         XI     0(R5),X'01'        doors(idoor)=not(doors(idoor))\nNEXTJ    B      LOOPJ\nELOOPJ   B      LOOPI\nELOOPI   LA     R10,BUFFER         R10 address of the buffer\n         LA     R5,DOORS           R5 address of doors item\n         LA     R6,1               idoor=1 (R6)\n         LA     R9,100             loop counter\nLOOPN    CLI    0(R5),X'01'        if doors(idoor)=1\n         BNE    NEXTN\n         XDECO  R6,XDEC            idoor to decimal\n         MVC    0(4,R10),XDEC+8    move decimal to buffer\n         LA     R10,4(R10)\nNEXTN\t LA     R6,1(R6)           idoor=idoor+1\n         LA     R5,1(R5)\n         BCT    R9,LOOPN           loop\nELOOPN   XPRNT  BUFFER,80\nRETURN   XR     R15,R15\n         BR     R14\nDOORS    DC     100X'00'\nBUFFER   DC     CL80' '\nXDEC     DS     CL12\n         YREGS\n         END    HUNDOOR",
560        "safe": true
561    },
562    {
563        "filename": "100 doors_20.txt",
564        "content": "HOW TO INITIALIZE:\n    SHARE doors\n    PUT {} IN doors\n    FOR door IN {1..100}:\n        PUT 0 IN doors[door]\n\nHOW TO TOGGLE door:\n    SHARE doors\n    PUT 1-doors[door] IN doors[door]\n\nHOW TO WALK step:\n    SHARE doors\n    PUT step IN door\n    WHILE door <= 100:\n        TOGGLE door\n        PUT door+step IN door\n\nHOW TO DISPLAY OPEN DOORS:\n    SHARE doors\n    FOR door IN {1..100}:\n        IF doors[door] = 1:\n            WRITE \"Door\", door, \"is open\"/\n\nINITIALIZE\nFOR pass IN {1..100}: WALK pass\nDISPLAY OPEN DOORS",
565        "safe": true
566    },
567    {
568        "filename": "100 doors_200.txt",
569        "content": "## NB: This code uses the dc command \"r\" via register \"r\".\n##     You may comment out the unwanted version.\n[SxSyLxLy]sr    # this should work with every \"dc\"\n[r]sr           # GNU dc can exchange top 2 stack values by \"r\"\n## Now use \"lrx\" instead of \"r\" ...\n\n0k              # we work without decimal places\n[q]sq           # useful e.g. as loop termination\n\n## (x)(y)>R  ==  if (y)>(x) eval R\n## isle         x y --> (x <= y)\n[\n    [1q]S. [\u00a0!<. 0 ]x s.L.\n]sl\n## l: isle\n\n[\n    100 llx\n]sL\n## L: isle100\n\n## for  initcode condcode incrcode body\n##       [1]      [2]      [3]      [4]\n[\n    [q]S. 4:. 3:. 2:. 1:.  1;.x [2;.x 0=. 4;.x 3;.x 0;.x]d0:.x Os.L.o\n]sf\n## f: for\n##----------------------------------------------------------------------------\n\n##      for( i=1\u00a0; i<=100\u00a0; ++i ) {\n##          door[i] = 0;\n##      }\n#[init ...]P []ps-\n[1si] [li lLx] [li1+si] [\n    li 0:d\n]lfx\n\n##      for( s=1\u00a0; s<=100\u00a0; ++s ) {\n##          for( i=s\u00a0; i<=100\u00a0; i+=s ) {\n##              door[i] = 1 - door[i]\n##          }\n##      }\n[1ss] [ls lLx] [ls1+ss] [\n    #[step ]P lsn [ ...]ps-\n    [lssi] [li lLx] [lils+si] [\n        1 li;d - li:d\n    ]lfx\n]lfx\n\n##      long output:\n##          for( i=1\u00a0; i<=100\u00a0; ++i ) {\n##              print \"door #\", i, \" is \", (door[i]\u00a0? \"open\"\u00a0: \"closed\")), NL\n##          }\n[\n    [1si] [li lLx] [li1+si] [\n        [door #]P\n        li n\n        [ is ]P\n            [closed]\n            [open]\n        li;d 0=r lrx s- n\n        [.]ps-\n    ]lfx\n]\n\n##      terse output:\n##          for( i=1\u00a0; i<=100\u00a0; ++i ) {\n##              if( door[i] ) {\n##                  print i\n##              }\n##              print NL\n##          }\n[\n    [1si] [li lLx] [li1+si] [\n        [] [ [ ]n lin ]\n        li;d 0=r lrx s- x\n    ]lfx\n    []ps-\n]\n\nlrx             # comment out for the long output version\ns- x\n#[stack rest...]P []ps- f",
570        "safe": true
571    },
572    {
573        "filename": "100 doors_201.txt",
574        "content": " 1 4 9 16 25 36 49 64 81 100\n",
575        "safe": true
576    },
577    {
578        "filename": "100 doors_202.txt",
579        "content": "$! doors.com\n$! Excecute by running @doors at prompt.\n$ square = 1\n$ incr = 3\n$ count2 = 0\n$ d = 1\n$ LOOP2:\n$       count2 = count2 + 1\n$       IF (d .NE. square)\n$               THEN WRITE SYS$OUTPUT \"door ''d' is closed\"\n$       ELSE WRITE SYS$OUTPUT \"door ''d' is open\"\n$               square = incr + square\n$               incr = incr + 2\n$       ENDIF\n$       d = d + 1\n$       IF (count2 .LT. 100) THEN GOTO LOOP2",
580        "safe": true
581    },
582    {
583        "filename": "100 doors_203.txt",
584        "content": "proc nonrec main() void:\n    byte DOORS = 100;\n    [DOORS+1] bool door_open;\n    unsigned DOORS i, j;\n\n    /* make sure all doors are closed */\n    for i from 1 upto DOORS do door_open[i]\u00a0:= false od;\n\n    /* pass through the doors */\n    for i from 1 upto DOORS do\n        for j from i by i upto DOORS do\n            door_open[j]\u00a0:= not door_open[j]\n        od\n    od;\n\n    /* show the open doors */\n    for i from 1 upto DOORS do\n        if door_open[i] then\n            writeln(\"Door \", i, \" is open.\")\n        fi\n    od\ncorp",
585        "safe": true
586    },
587    {
588        "filename": "100 doors_204.txt",
589        "content": "Door 1 is open.\nDoor 4 is open.\nDoor 9 is open.\nDoor 16 is open.\nDoor 25 is open.\nDoor 36 is open.\nDoor 49 is open.\nDoor 64 is open.\nDoor 81 is open.\nDoor 100 is open.",
590        "safe": true
591    },
592    {
593        "filename": "100 doors_205.txt",
594        "content": "100[$][0^:1-]#                                                  {initialize doors}\n%\n[s;[$101<][$$;~\\:s;+]#%]d:                                     {function d, switch door state function}\n1s:[s;101<][d;!s;1+s:]#                                        {increment step width from 1 to 100, execute function d each time}\n1[$101<][$$.' ,;['o,'p,'e,'n,10,]['c,'l,'o,'s,'e,'d,10,]?1+]#  {loop through doors, print door number and state}",
595        "safe": true
596    },
597    {
598        "filename": "100 doors_206.txt",
599        "content": "1 open\n2 closed\n3 closed\n4 open\n5 closed\n6 closed\n7 closed\n8 closed\n9 open\n10 closed\n11 closed\n12 closed\n...\n94 closed\n95 closed\n96 closed\n97 closed\n98 closed\n99 closed\n100 open",
600        "safe": true
601    },
602    {
603        "filename": "100 doors_207.txt",
604        "content": "var doors\u00a0: array [1..100] of Boolean;\nvar i, j\u00a0: Integer;\n\nfor i\u00a0:= 1 to 100 do\n   for j\u00a0:= i to 100 do\n      if (j mod i) = 0 then\n         doors[j]\u00a0:= not doors[j];F\n\nfor i\u00a0:= 1 to 100 do\n   if doors[i] then\n      PrintLn('Door '+IntToStr(i)+' is open');",
605        "safe": true
606    },
607    {
608        "filename": "100 doors_208.txt",
609        "content": "var doors = Array.Empty(100, false)\n \nfor p in 0..99 {\n    for d in 0..99 {\n        if (d + 1)\u00a0% (p + 1) == 0 {\n            doors[d] = !doors[d];\n        }\n    }\n}\n \nfor d in doors.Indices() when doors[d] {\n    print(\"Door \\(d+1): Open\")\n}",
610        "safe": true
611    },
612    {
613        "filename": "100 doors_209.txt",
614        "content": "Door 1: Open\nDoor 4: Open\nDoor 9: Open\nDoor 16: Open\nDoor 25: Open\nDoor 36: Open\nDoor 49: Open\nDoor 64: Open\nDoor 81: Open\nDoor 100: Open",
615        "safe": true
616    },
617    {
618        "filename": "100 doors_21.txt",
619        "content": "Door 1 is open\nDoor 4 is open\nDoor 9 is open\nDoor 16 is open\nDoor 25 is open\nDoor 36 is open\nDoor 49 is open\nDoor 64 is open\nDoor 81 is open\nDoor 100 is open",
620        "safe": true
621    },
622    {
623        "filename": "100 doors_210.txt",
624        "content": "define function doors ()\n  let n = 100;\n  let doors = make(<vector>, size: n, fill: #f);\n  for (x from 0 below n)\n    for (y from x below n by x + 1)\n      doors[y]\u00a0:= ~doors[y]\n    end\n  end;\n  format-out(\"open: \");\n  for (x from 0 below n) \n    if (doors[x]) \n      format-out(\"%d \", x + 1)\n    end\n  end\nend function;",
625        "safe": true
626    },
627    {
628        "filename": "100 doors_211.txt",
629        "content": "local :open-doors [ rep 101 false ]\n\nfor i range 1 100:\n\tlocal :j i\n\twhile <= j 100:\n\t\tset-to open-doors j not open-doors! j\n\t\tset :j + j i\n\n!print\\ \"Open doors: \"\nfor i range 1 100:\n\tif open-doors! i:\n\t\t!print\\( to-str i \" \" )",
630        "safe": true
631    },
632    {
633        "filename": "100 doors_212.txt",
634        "content": "Open doors: 1 4 9 16 25 36 49 64 81 100 ",
635        "safe": true
636    },
637    {
638        "filename": "100 doors_213.txt",
639        "content": "#!/usr/bin/env rune\n\nvar toggles\u00a0:= []\nvar gets\u00a0:= []\n\n# Set up GUI (and data model)\ndef frame\u00a0:= <swing:makeJFrame>(\"100 doors\")\nframe.getContentPane().setLayout(<awt:makeGridLayout>(10, 10))\nfor i in 1..100 {\n  def component\u00a0:= <import:javax.swing.makeJCheckBox>(E.toString(i))\n  toggles with= fn { component.setSelected(!component.isSelected()) }\n  gets with= fn { component.isSelected() }\n  frame.getContentPane().add(component)\n}\n\n# Set up termination condition\ndef done\nframe.addWindowListener(def _ {\n  to windowClosing(event) {\n    bind done\u00a0:= true\n  }\n  match _ {}\n})\n\n# Open and close doors\ndef loop(step, i) {\n  toggles[i] <- ()\n  def next\u00a0:= i + step\n  timer.whenPast(timer.now() + 10, fn {\n    if (next >= 100) {\n      if (step >= 100) {\n        # Done.\n      } else {\n        loop <- (step + 1, step)\n      }\n    } else {\n      loop <- (step, i + step)\n    }    \n  })\n}\nloop(1, 0)\n\nframe.pack()\nframe.show()\ninterp.waitAtTop(done)",
640        "safe": true
641    },
642    {
643        "filename": "100 doors_214.txt",
644        "content": "len d[] 100\nfor p = 1 to 100\n   i = p\n   while i <= 100\n      d[i] = 1 - d[i]\n      i += p\n   .\n.\nfor i = 1 to 100\n   if d[i] = 1\n      print i\n   .\n.",
645        "safe": true
646    },
647    {
648        "filename": "100 doors_215.txt",
649        "content": "; initial state = closed = #f\n(define doors (make-vector 101 #f))\n; run pass 100 to 1\n(for* \n   ((pass (in-range 100 0 -1)) \n   (door (in-range 0 101 pass))) \n    (when (and \n        (vector-set! doors door (not (vector-ref doors door))) \n        (= pass 1)) \n        (writeln door \"is open\"))) \n\n1     \"is open\"    \n4     \"is open\"    \n9     \"is open\"    \n16     \"is open\"    \n25     \"is open\"    \n36     \"is open\"    \n49     \"is open\"    \n64     \"is open\"    \n81     \"is open\"    \n100     \"is open\"",
650        "safe": true
651    },
652    {
653        "filename": "100 doors_216.txt",
654        "content": "Doors\u00a0:= RECORD\n UNSIGNED1 DoorNumber;\n STRING6   State;\nEND;\n\nAllDoors\u00a0:= DATASET([{0,0}],Doors);\n\nDoors  OpenThem(AllDoors L,INTEGER Cnt)\u00a0:= TRANSFORM\n SELF.DoorNumber\u00a0:= Cnt;\n SELF.State     \u00a0:= IF((CNT * 10)\u00a0% (SQRT(CNT)*10)<>0,'Closed','Opened');\nEND;\n\nOpenDoors\u00a0:= NORMALIZE(AllDoors,100,OpenThem(LEFT,COUNTER));\n \nOpenDoors;",
655        "safe": true
656    },
657    {
658        "filename": "100 doors_217.txt",
659        "content": "Doors\u00a0:= RECORD\n  UNSIGNED1 DoorNumber;\n  STRING6   State;\nEND;\n\nAllDoors\u00a0:= DATASET([{0,'0'}],Doors);\n\n//first build the 100 doors\n\nDoors  OpenThem(AllDoors L,INTEGER Cnt)\u00a0:= TRANSFORM\n  SELF.DoorNumber\u00a0:= Cnt;\n  SELF.State     \u00a0:= 'Closed';\nEND;\n\nClosedDoors\u00a0:= NORMALIZE(AllDoors,100,OpenThem(LEFT,COUNTER));\n\n//now iterate through them and use door logic\n\nloopBody(DATASET(Doors) ds, UNSIGNED4 c)\u00a0:=\n            PROJECT(ds,    //ds=original input\n              TRANSFORM(Doors,\n                      \tSELF.State\u00a0:= CASE((COUNTER\u00a0% c) * 100,\n\t\t                            0 => IF(LEFT.STATE = 'Opened','Closed','Opened')\n\t\t\t\t\t    ,LEFT.STATE);\n\t\t\tSELF.DoorNumber\u00a0:= COUNTER;     //PROJECT COUNTER\n                    ));\n   \ng1\u00a0:= LOOP(ClosedDoors,100,loopBody(ROWS(LEFT),COUNTER));\n   \nOUTPUT(g1);",
660        "safe": true
661    },
662    {
663        "filename": "100 doors_218.txt",
664        "content": "DoorSet\u00a0:= DATASET(100,TRANSFORM({UNSIGNED1 DoorState},SELF.DoorState\u00a0:= 1));\nSetDoors\u00a0:= SET(DoorSet,DoorState);\n\nDoors\u00a0:= RECORD\n  UNSIGNED1 Pass;\n  SET OF UNSIGNED1 DoorSet;\nEND;\n\nStartDoors\u00a0:= DATASET(100,TRANSFORM(Doors,SELF.Pass\u00a0:= COUNTER,SELF.DoorSet\u00a0:= SetDoors));\n\nDoors XF(Doors L, Doors R)\u00a0:= TRANSFORM\n  ds\u00a0:= DATASET(L.DoorSet,{UNSIGNED1 DoorState});\n  NextDoorSet\u00a0:= PROJECT(ds,  \n                         TRANSFORM({UNSIGNED1 DoorState},\n                      \t           SELF.DoorState\u00a0:= CASE((COUNTER\u00a0% R.Pass) * 100,\n                                                          0 => IF(LEFT.DoorState = 1,0,1),\n                                                          LEFT.DoorState)));\n  SELF.DoorSet\u00a0:= IF(L.Pass=0,R.DoorSet,SET(NextDoorSet,DoorState));\t\t\t\t\t\t\t\t\t\n  SELF.Pass\u00a0:= R.Pass\t\t\t\t\t\t\t\t\t\t\nEND;\t\t\t\t\t\t\t\t\t\t\n \nRes\u00a0:= DATASET(ITERATE(StartDoors,XF(LEFT,RIGHT))[100].DoorSet,{UNSIGNED1 DoorState});\nPROJECT(Res,TRANSFORM({STRING20 txt},SELF.Txt\u00a0:= 'Door ' + COUNTER + ' is ' + IF(LEFT.DoorState=1,'Open','Closed')));",
665        "safe": true
666    },
667    {
668        "filename": "100 doors_219.txt",
669        "content": "module OneHundredDoors {\n    void run() {\n        Boolean[] doors = new Boolean[100];\n        for (Int pass\u00a0: 0 ..< 100) {\n            for (Int door = pass; door < 100; door += 1+pass) {\n                doors[door] = !doors[door];\n            }\n        }\n\n        @Inject Console console;\n        console.print($|open doors: {doors.mapIndexed((d, i) -> d\u00a0? i+1\u00a0: 0)\n                       |                  .filter(i -> i > 0)}\n                     );\n    }\n}",
670        "safe": true
671    },
672    {
673        "filename": "100 doors_22.txt",
674        "content": "(defun rep (n x)\n   (if (zp n)\n       nil\n       (cons x\n             (rep (- n 1) x))))\n\n(defun toggle-every-r (n i bs)\n   (if (endp bs)\n       nil\n       (cons (if (zp i)\n                 (not (first bs))\n                 (first bs))\n             (toggle-every-r n (mod (1- i) n) (rest bs)))))\n\n(defun toggle-every (n bs)\n   (toggle-every-r n (1- n) bs))\n\n(defun 100-doors (i doors)\n   (if (zp i)\n       doors\n       (100-doors (1- i) (toggle-every i doors))))\n",
675        "safe": true
676    },
677    {
678        "filename": "100 doors_220.txt",
679        "content": "open doors: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100\n",
680        "safe": true
681    },
682    {
683        "filename": "100 doors_221.txt",
684        "content": "[Hundred doors problem from Rosetta Code website]\n[EDSAC program, Initial Orders 2]\n\n[Library subroutine M3. Prints header and is then overwritten.\nHere, the last character sets the teleprinter to figures.]\n       PFGKIFAFRDLFUFOFE@A6FG@E8FEZPF\n       @&*THE!OPEN!DOORS!ARE@&#\n       ..PZ   [blank tape, needed to mark end of header text]\n\n[Library subroutine P6. Prints strictly positive integer.\n32 locations; working locations 1, 4, 5]\n        T56K  [define load address for subroutine]\n        GKA3FT25@H29@VFT4DA3@TFH30@S6@T1F\n        V4DU4DAFG26@TFTFO5FA4DF4FS4F\n        L4FT4DA1FS3@G9@EFSFO31@E20@J995FJF!F\n\n        T88K   [define load address for main program]\n        GK     [set @ (theta) for relative addresses]\n\n[The 100 doors are at locations 200..299.\nDoors are numbered 0..99 internally, and 1..100 for output.\nThe base address and the number of doors can be varied.\nThe value of a door is 0 if open, negative if closed.]\n\n                   [Constants. Program also uses order 'P 1 F'\n                    which is permanently at absolute address 2.]\n    [0] P200F  [address of door #0]\n    [1] P100F  [number of doors, as an address]\n    [2] UF     [makes S order from T, since 'S' = 'T' + 'U']\n    [3] MF     [makes A order from T, since 'A' = 'T' + 'M']\n    [4] V2047D [all 1's for \"closed\" (any negative value will do)]\n    [5] &F     [line feed]\n    [6] @F     [carriage return]\n    [7] K4096F [teleprinter null[\n\n                   [Variables]\n    [8] PF   [pass number; step when toggling doors]\n    [9] PF   [door number, as address, 0-based]\n   [10] PF   [order referring to door 0]\n\n                   [Enter with acc = 0]\n                   [Part 1\u00a0: close all the doors]\n   [11] T8@  [pass\u00a0:= 0 (used in part 2)]\n        T9@  [door number\u00a0:= 0]\n        A16@ [load 'T F' order]\n        A@   [add base address]\n        T10@ [store T order for door #0]\n   [16] TF   [clear acc; also serves as constant]\n        A9@  [load door number]\n        A10@ [make T order]\n        T21@ [plant in code]\n        A4@  [load value for \"closed\"]\n   [21] TF   [store in current door]\n        A9@  [load door number]\n        A2F  [add 1]\n        U9@  [update door number]\n        S1@  [done all doors yet?]\n        G16@ [if not, loop back]\n\n                   [Part 2\u00a0: 100 passes, toggling the doors]\n   [27] TF   [clear acc]\n        A8@  [load pass number]\n        A2F  [add 1]\n        T8@  [save updated pass number]\n        S2F  [make -1]\n        U9@  [door number\u00a0:= -1]\n        A8@  [add pass number to get first door toggled on this pass]\n        S1@  [gone beyond end?]\n        E50@ [if so, move on to part 3]\n   [36] A1@  [restore acc after test]\n        U9@  [store current door number]\n        A10@ [make T order to load status]\n        U44@ [plant T order for first door in pass]\n        A2@  [convert to S order]\n        T43@ [plant S order]\n        A4@  [load value for \"closed\"]\n   [43] SF   [subtract status; toggles status]\n   [44] TF   [update status]\n        A9@  [load door number just toggled]\n        A8@  [add pass number to get next door in pass]\n        S1@  [gone beyond end?]\n        G36@ [no, loop to do next door]\n        E27@ [yes, loop to do next pass]\n\n                   [Part 3\u00a0: Print list of open doors.\n                    Header has set teleprinter to figures.]\n   [50] TF   [clear acc]\n        T9@  [door nr\u00a0:= 0]\n        A10@ [T order for door 0]\n        A3@  [convert to A order]\n        T10@\n   [55] TF\n        A9@  [load door number]\n        A10@ [make A order to load value]\n        T59@ [plant in next order]\n   [59] AF   [acc\u00a0:= 0 if open, < 0 if closed]\n        G69@ [skip if closed]\n        A9@  [door number as address]\n        A2F  [add 1 for 1-based output]\n        RD   [shift 1 right, address --> integer]\n        TF   [store integer at 0 for printing]\n   [65] A65@ [for return from subroutine]\n        G56F [call subroutine to print door number]\n        O6@  [followed by CRLF]\n        O5@\n   [69] TF   [clear acc]\n        A9@  [load door number]\n        A2F  [add 1]\n        U9@  [update door number]\n        S1@  [done all doors yet?]\n        G55@  [if not, loop back]\n   [75] O7@  [output null to flush teleprinter buffer]\n        ZF   [stop]\n        E11Z [define relative start address]\n        PF",
685        "safe": true
686    },
687    {
688        "filename": "100 doors_222.txt",
689        "content": "THE OPEN DOORS ARE\n    1\n    4\n    9\n   16\n   25\n   36\n   49\n   64\n   81\n  100\n",
690        "safe": true
691    },
692    {
693        "filename": "100 doors_223.txt",
694        "content": "#import <Foundation/Foundation.h>\n\nint main()\n  square\u00a0:= 1, increment = 3\n\n  for int door in 1 .. 100\n    printf(\"door #%d\", door)\n\n    if door == square\n      puts(\" is open.\")\n      square += increment\n      increment += 2\n    else\n      puts(\" is closed.\")\n\n  return 0",
695        "safe": true
696    },
697    {
698        "filename": "100 doors_224.txt",
699        "content": "import \"prelude.eg\"\n\nusing System\nusing List\n\ndata open, closed\n\ndef toggle =\n    [ open N -> closed N | closed N -> open N ]\n\ndef doors =\n    [ N -> map [ N -> closed N ] (fromto 1 N) ]\n\ndef toggleK =\n    [ K nil              -> nil\n    | K (cons (D N) DD)  -> \n         let DOOR = if (N%K) == 0 then toggle (D N) else D N in\n             cons DOOR (toggleK K DD) ]\n\ndef toggleEvery =\n    [ nil DOORS -> DOORS\n    | (cons K KK) DOORS -> toggleEvery KK (toggleK K DOORS) ]\n\ndef run =\n    [ N -> toggleEvery (fromto 1 N) (doors N) ]\n\ndef main = run 100",
700        "safe": true
701    },
702    {
703        "filename": "100 doors_225.txt",
704        "content": "program OneHundredDoors\n\n   function main()\n\n      doors boolean[] = new boolean[100];\n      n int = 100;\n\n      for (i int from 1 to n)\n         for (j int from i to n by i)\n            doors[j] = !doors[j];\n         end\n      end\n             \n      for (i int from 1 to n)\n         if (doors[i])\n            SysLib.writeStdout( \"Door \" + i + \" is open\" );\n         end\n      end\n \n   end\n\nend",
705        "safe": true
706    },
707    {
708        "filename": "100 doors_226.txt",
709        "content": "note\n\tdescription: \"100 Doors problem\"\n\tdate: \"08-JUL-2015\"\n\trevision: \"1.1\"\n\nclass\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature {NONE} -- Initialization\n\n\tmake\n\t\t\t-- Main application routine.\n\t\tdo\n\t\t\tinitialize_closed_doors\n\t\t\ttoggle_doors\n\t\t\toutput_door_states\n\t\tend\n\nfeature -- Access\n\n\tdoors: ARRAYED_LIST [DOOR]\n\t\t\t-- A set of doors (self-initialized to capacity of `max_door_count').\n\t\tattribute\n\t\t\tcreate Result.make (max_door_count)\n\t\tend\n\nfeature -- Basic Operations\n\n\tinitialize_closed_doors\n\t\t\t-- Initialize all `doors'.\n\t\tdo\n\t\t\tacross min_door_count |..| max_door_count as ic_address_list loop\n\t\t\t\tdoors.extend (create {DOOR}.make_closed (ic_address_list.item))\n\t\t\tend\n\t\tensure\n\t\t\thas_all_closed_doors: across doors as ic_doors_list all not ic_doors_list.item.is_open end\n\t\tend\n\n\ttoggle_doors\n\t\t\t-- Toggle all `doors'.\n\t\tdo\n\t\t\tacross min_door_count |..| max_door_count as ic_addresses_list loop\n\t\t\t\tacross doors as ic_doors_list loop\n\t\t\t\t\tif is_door_to_toggle (ic_doors_list.item.address, ic_addresses_list.item) then\n\t\t\t\t\t\tic_doors_list.item.toggle_door\n\t\t\t\t\tend\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\n\toutput_door_states\n\t\t\t-- Output the state of all `doors'.\n\t\tdo\n\t\t\tdoors.do_all (agent door_state_out)\n\t\tend\n\nfeature -- Status Report\n\n\tis_door_to_toggle (a_door_address, a_index_address: like {DOOR}.address): BOOLEAN\n\t\t\t-- Is the door at `a_door_address' needing to be toggled, when compared to `a_index_address'?\n\t\tdo\n\t\t\tResult\u00a0:= a_door_address \\\\ a_index_address = 0\n\t\tensure\n\t\t\tonly_modulus_zero: Result = (a_door_address \\\\ a_index_address = 0)\n\t\tend\n\nfeature -- Outputs\n\n\tdoor_state_out (a_door: DOOR)\n\t\t\t-- Output the state of `a_door'.\n\t\tdo\n\t\t\tprint (\"Door \" + a_door.address.out + \" is \")\n\t\t\tif a_door.is_open then\n\t\t\t\tprint (\"open.\")\n\t\t\telse\n\t\t\t\tprint (\"closed.\")\n\t\t\tend\n\t\t\tio.new_line\n\t\tend\n\nfeature {DOOR} -- Constants\n\n\tmin_door_count: INTEGER = 1\n\t\t\t-- Minimum number of doors.\n\n\tmax_door_count: INTEGER = 100\n\t\t\t-- Maximum number of doors.\n\nend",
710        "safe": true
711    },
712    {
713        "filename": "100 doors_227.txt",
714        "content": "note\n\tdescription: \"A door with an address and an open or closed state.\"\n\tdate: \"08-JUL-2015\"\n\trevision: \"1.1\"\n\nclass\n\tDOOR\n\ncreate\n\tmake_closed,\n\tmake\n\nfeature {NONE} -- initialization\n\n\tmake_closed (a_address: INTEGER)\n\t\t\t-- Initialize Current {DOOR} at `a_address' and state of `Is_closed'.\n\t\trequire\n\t\t\tpositive: a_address >= {APPLICATION}.min_door_count and a_address >= Min_door_count\n\t\tdo\n\t\t\tmake (a_address, Is_closed)\n\t\tensure\n\t\t\tclosed: is_open = Is_closed\n\t\tend\n\n\tmake (a_address: INTEGER; a_status: BOOLEAN)\n\t\t\t-- Initialize Current {DOOR} with `a_address' and `a_status', denoting position and `is_open' or `Is_closed'.\n\t\trequire\n\t\t\tpositive: a_address >= {APPLICATION}.min_door_count and a_address >= Min_door_count\n\t\tdo\n\t\t\taddress\u00a0:= a_address\n\t\t\tis_open\u00a0:= a_status\n\t\tensure\n\t\t\taddress_set: address = a_address\n\t\t\tstatus_set: is_open = a_status\n\t\tend\n\nfeature -- access\n\n\taddress: INTEGER\n\t\t\t-- `address' of Current {DOOR}.\n\n\tis_open: BOOLEAN assign set_open\n\t\t\t-- `is_open' (or not) status of Current {DOOR}.\n\nfeature -- Setters\n\n\tset_open (a_status: BOOLEAN)\n\t\t\t-- Set `status' with `a_status'\n\t\tdo\n\t\t\tis_open\u00a0:= a_status\n\t\tensure\n\t\t\topen_updated: is_open = a_status\n\t\tend\n\nfeature {APPLICATION} -- Basic Operations\n\n\ttoggle_door\n\t\t\t-- Toggle Current {DOOR} from `is_open' to not `is_open'.\n\t\tdo\n\t\t\tis_open\u00a0:= not is_open\n\t\tensure\n\t\t\ttoggled: is_open /= old is_open\n\t\tend\n\nfeature {NONE} -- Implementation: Constants\n\n\tIs_closed: BOOLEAN = False\n\t\t\t-- State of being not `is_open'.\n\n\tMin_door_count: INTEGER = 1\n\t\t\t-- Minimum door count.\n\ninvariant\n\tone_or_more: address >= 1\n\tconsistency: is_open implies not Is_closed\n\nend",
715        "safe": true
716    },
717    {
718        "filename": "100 doors_228.txt",
719        "content": "open generic\n\ntype Door = Open | Closed\n  deriving Show\n\ngate [] _ = []\ngate (x::xs) (y::ys) \n  | x == y = Open\u00a0:: gate xs ys\n  | else = Closed\u00a0:: gate xs ys\n\nrun n = gate [1..n] [& k*k \\\\ k <- [1..]]",
720        "safe": true
721    },
722    {
723        "filename": "100 doors_229.txt",
724        "content": "open list\nrun n = takeWhile (<n) [& k*k \\\\ k <- [1..]]",
725        "safe": true
726    },
727    {
728        "filename": "100 doors_23.txt",
729        "content": "DEFINE COUNT=\"100\"\n\nPROC Main()\n  BYTE ARRAY doors(COUNT+1)\n  BYTE door,pass\n\n  FOR door=1 TO COUNT\n  DO\n    doors(door)=0\n  OD\n  \n  PrintE(\"Following doors are open:\")\n  FOR pass=1 TO COUNT\n  DO\n    FOR door=pass TO COUNT STEP pass\n    DO\n      doors(door)==!$FF\n    OD\n    IF doors(pass)=$FF THEN\n      PrintB(pass) Put(32)\n    FI\n  OD\nRETURN",
730        "safe": true
731    },
732    {
733        "filename": "100 doors_230.txt",
734        "content": "import system'routines;\nimport extensions;\n\npublic program()\n{ \n    var Doors\u00a0:= Array.allocate(100).populate::(n=>false);\n    for(int i\u00a0:= 0; i < 100; i++)\n    {\n        for(int j\u00a0:= i; j < 100; j\u00a0:= j + i + 1)\n        {\n            Doors[j]\u00a0:= Doors[j].Inverted\n        }\n    };\n \n    for(int i\u00a0:= 0; i < 100; i++)\n    {\n        console.printLine(\"Door #\",i + 1,\"\u00a0:\",Doors[i].iif(\"Open\",\"Closed\"))\n    };\n \n    console.readChar()\n}",
735        "safe": true
736    },
737    {
738        "filename": "100 doors_231.txt",
739        "content": "defmodule HundredDoors do\n  def doors(n \\\\ 100) do\n    List.duplicate(false, n)\n  end\n  \n  def toggle(doors, n) do\n    List.update_at(doors, n, &(!&1))\n  end\n  \n  def toggle_every(doors, n) do\n    Enum.reduce( Enum.take_every((n-1)..99, n), doors, fn(n, acc) -> toggle(acc, n) end )\n  end\nend\n\n# unoptimized\nfinal_state = Enum.reduce(1..100, HundredDoors.doors, fn(n, acc) -> HundredDoors.toggle_every(acc, n) end)\n\nopen_doors = Enum.with_index(final_state)\n             |> Enum.filter_map(fn {door,_} -> door end, fn {_,index} -> index+1 end)\n\nIO.puts \"All doors are closed except these: #{inspect open_doors}\"\n\n\n# optimized \nfinal_state = Enum.reduce(1..10, HundredDoors.doors, fn(n, acc) -> HundredDoors.toggle(acc, n*n-1) end)\n\nopen_doors = Enum.with_index(final_state)\n             |> Enum.filter_map(fn {door,_} -> door end, fn {_,index} -> index+1 end)\n\nIO.puts \"All doors are closed except these: #{inspect open_doors}\"",
740        "safe": true
741    },
742    {
743        "filename": "100 doors_232.txt",
744        "content": "All doors are closed except these: [1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
745        "safe": true
746    },
747    {
748        "filename": "100 doors_233.txt",
749        "content": "-- Unoptimized\nimport List exposing (indexedMap, foldl, repeat, range)\nimport Html exposing (text)\nimport Debug exposing (toString)\n\ntype Door = Open | Closed\n\ntoggle d = if d == Open then Closed else Open\n\ntoggleEvery\u00a0: Int -> List Door -> List Door\ntoggleEvery k doors = indexedMap \n  (\\i door -> if modBy k (i+1) == 0 then toggle door else door)\n  doors\n\nn = 100\n\nmain = \n  text (toString (foldl toggleEvery (repeat n Closed) (range 1 n)))",
750        "safe": true
751    },
752    {
753        "filename": "100 doors_234.txt",
754        "content": "(defun create-doors ()\n  \"Returns a list of closed doors\n\nEach door only has two status: open or closed.\nIf a door is closed it has the value 0, if it's open it has the value 1.\"\n  (let ((return_value '(0))\n        \u00a0;; There is already a door in the return_value, so k starts at 1\n        \u00a0;; otherwise we would need to compare k against 99 and not 100 in\n        \u00a0;; the while loop\n         (k 1))\n    (while (< k 100)\n      (setq return_value (cons 0 return_value))\n      (setq k (+ 1 k)))\n    return_value))\n\n(defun toggle-single-door (doors)\n  \"Toggle the stat of the door at the `car' position of the DOORS list\n\nDOORS is a list of integers with either the value 0 or 1 and it represents\na row of doors.\n\nReturns a list where the `car' of the list has it's value toggled (if open\nit becomes closed, if closed it becomes open).\"\n  (if (= (car doors) 1)\n    (cons 0 (cdr doors))\n    (cons 1 (cdr doors))))\n\n(defun toggle-doors (doors step original-step)\n  \"Step through all elements of the doors' list and toggle a door when step is 1\n\nDOORS is a list of integers with either the value 0 or 1 and it represents\na row of doors.\nSTEP is the number of doors we still need to transverse before we arrive\nat a door that has to be toggled.\nORIGINAL-STEP is the value of the argument step when this function is\ncalled for the first time.\n\nReturns a list of doors\"\n  (cond ((null doors)\n          '())\n    ((= step 1)\n      (cons (car (toggle-single-door doors))\n        (toggle-doors (cdr doors) original-step original-step)))\n    (t\n      (cons (car doors)\n        (toggle-doors (cdr doors) (- step 1) original-step)))))\n\n(defun main-program ()\n  \"The main loop for the program\"\n  (let ((doors_list (create-doors))\n         (k 1)\n        \u00a0;; We need to define max-specpdl-size and max-specpdl-size to big\n        \u00a0;; numbers otherwise the loop reaches the max recursion depth and\n        \u00a0;; throws an error.\n        \u00a0;; If you want more information about these variables, press Ctrl\n        \u00a0;; and h at the same time and then press v and then type the name\n        \u00a0;; of the variable that you want to read the documentation.\n         (max-specpdl-size 5000)\n         (max-lisp-eval-depth 2000))\n    (while (< k 101)\n      (setq doors_list (toggle-doors doors_list k k))\n      (setq k (+ 1 k)))\n    doors_list))\n\n(defun print-doors (doors)\n  \"This function prints the values of the doors into the current buffer.\n\nDOORS is a list of integers with either the value 0 or 1 and it represents\na row of doors.\n\"\n \u00a0;; As in the main-program function, we need to set the variable\n \u00a0;; max-lisp-eval-depth to a big number so it doesn't reach max recursion\n \u00a0;; depth.\n  (let ((max-lisp-eval-depth 5000))\n    (unless (null doors)\n      (insert (int-to-string (car doors)))\n      (print-doors (cdr doors)))))\n\n;; Returns a list with the final solution\n(main-program)\n\n;; Print the final solution on the buffer\n(print-doors (main-program))",
755        "safe": true
756    },
757    {
758        "filename": "100 doors_235.txt",
759        "content": "type Door:State\nenum do int CLOSED, OPEN end\ntype Door\nmodel\n  int id\n  Door:State state\n  new by int \u2190id, Door:State \u2190state do end\n  fun toggle \u2190 <|me.state \u2190 when(me.state \u00e6 Door:State.CLOSED, Door:State.OPEN, Door:State.CLOSED)\n  fun asText \u2190 <|\"Door #\" + me.id + \" is \" + when(me.state \u00e6 Door:State.CLOSED, \"closed\", \"open\")\nend\ntype Main\n^|There are 100 doors in a row that are all initially closed.|^\nList doors \u2190 Door[].with(100, <int i|Door(i + 1, Door:State.CLOSED))\n^|You make 100 passes by the doors.|^\nfor int pass \u2190 0; pass < 100; ++pass\n  for int i \u2190 pass; i < 100; i += pass + 1\n    doors[i].toggle()\n  end\nend\n^|Which are open, which are closed?|^\nfor each Door door in doors\n  if door.state \u00e6 Door:State.CLOSED do continue end\n  writeLine(door)\nend",
760        "safe": true
761    },
762    {
763        "filename": "100 doors_236.txt",
764        "content": "Door #1 is open\nDoor #4 is open\nDoor #9 is open\nDoor #16 is open\nDoor #25 is open\nDoor #36 is open\nDoor #49 is open\nDoor #64 is open\nDoor #81 is open\nDoor #100 is open\n",
765        "safe": true
766    },
767    {
768        "filename": "100 doors_237.txt",
769        "content": "-module(hundoors).\n\n-export([go/0]).\n\ntoggle(closed) -> open;\ntoggle(open) -> closed.\n\ngo() -> go([closed || _ <- lists:seq(1, 100)],[], 1, 1).\ngo([], L, N, _I) when N =:= 101 -> lists:reverse(L);\ngo([], L, N, _I) -> go(lists:reverse(L), [], N + 1, 1);\ngo([H|T], L, N, I) ->\n  H2 = case I rem N of\n    0 -> toggle(H);\n    _ -> H\n  end,\n  go(T, [H2|L], N, I + 1).",
770        "safe": true
771    },
772    {
773        "filename": "100 doors_238.txt",
774        "content": "array_go() -> go(array:new([101, fixed, {default, closed}]), 1, 1).\n\ngo(Array, Big, Inc) when Big > 100, Inc =< 100 ->\n    go(Array, Inc + 1, Inc + 1);\ngo(Array, Index, Inc) when Inc < 101 ->\n    go(array:set(Index, toggle(Array, Index), Array), Index + Inc, Inc);\ngo(Array, _, _) -> array:sparse_to_orddict(Array).\n\ntoggle(Array, Index) -> toggle(array:get(Index, Array)).",
775        "safe": true
776    },
777    {
778        "filename": "100 doors_239.txt",
779        "content": " task_100_doors:array_go().\n[{1,open},\n {4,open},\n {9,open},\n {16,open},\n {25,open},\n {36,open},\n {49,open},\n {64,open},\n {81,open},\n {100,open}]\n",
780        "safe": true
781    },
782    {
783        "filename": "100 doors_24.txt",
784        "content": "Following doors are open:\n1 4 9 16 25 36 49 64 81 100\n",
785        "safe": true
786    },
787    {
788        "filename": "100 doors_240.txt",
789        "content": "doors() ->\n     F = fun(X) -> Root = math:pow(X,0.5), Root == trunc(Root) end,\n     Out = fun(X, true) -> io:format(\"Door ~p: open~n\",[X]);\n              (X, false)-> io:format(\"Door ~p: close~n\",[X]) end,\n     [Out(X,F(X)) || X <- lists:seq(1,100)].",
790        "safe": true
791    },
792    {
793        "filename": "100 doors_241.txt",
794        "content": "! \"100 Doors\" program for ERRE LANGUAGE\n! Author: Claudio Larini\n! Date: 21-Nov-2014\n!\n! PC Unoptimized version translated from a QB version\n\nPROGRAM 100DOORS\n\n!$INTEGER\n\nCONST N=100\n\nDIM DOOR[N]\n\nBEGIN\n\nFOR STRIDE=1 TO N DO\n    FOR INDEX=STRIDE TO N STEP STRIDE DO\n        DOOR[INDEX]=NOT(DOOR[INDEX])\n    END FOR\nEND FOR\n\nPRINT(\"Open doors:\";)\nFOR INDEX=1 TO N DO\n    IF DOOR[INDEX] THEN PRINT(INDEX;) END IF\nEND FOR\nPRINT\n\nEND PROGRAM",
795        "safe": true
796    },
797    {
798        "filename": "100 doors_242.txt",
799        "content": "begin     new doors; new i; label doorLoop; label outDoors;\n          doors <- list 100;\n          i     <- 0;\ndoorLoop: if [ i <- i + 1 ] <= length doors then begin\n             new j; label flipLoop;\n             j  <- 0;\nflipLoop:    if [ j <- J + i ] <= length doors then begin\n                doors[ j ] <- isu doors[ j ] or not doors[ j ];\n                goto flipLoop\n             end else 0;\n             goto doorLoop\n          end else 0;\n          i <- 0;\noutDoors: if [ i <- i + 1 ] <= length doors then begin\n             if doors[ i ] then out i else 0;\n             goto outDoors\n          end else 0\nend $\n",
800        "safe": true
801    },
802    {
803        "filename": "100 doors_243.txt",
804        "content": ">function Doors () ...\n$  doors:=zeros(1,100);\n$  for i=1 to 100\n$    for j=i to 100 step i\n$      doors[j]=!doors[j];\n$    end;\n$  end;\n$  return doors\n$endfunction\n>nonzeros(Doors())\n [ 1  4  9  16  25  36  49  64  81  100 ]",
805        "safe": true
806    },
807    {
808        "filename": "100 doors_244.txt",
809        "content": "-- doors.ex\ninclude std/console.e\nsequence doors\ndoors = repeat( 0, 100 ) -- 1 to 100, initialised to false \n\nfor pass = 1 to 100 do\n\tfor door = pass to 100 by pass do\n\t\t--printf( 1, \"%d\", doors[door] )\n\t\t--printf( 1, \"%d\", not doors[door] )\n\t\tdoors[door] = not doors[door]\n\tend for\nend for\n\nsequence oc\n\nfor i = 1 to 100 do\n\tif doors[i] then\n\t\toc = \"open\"\n\telse\n\t\toc = \"closed\"\n\tend if\n \tprintf( 1, \"door %d is %s\\n\", { i, oc } )\nend for",
810        "safe": true
811    },
812    {
813        "filename": "100 doors_245.txt",
814        "content": "=IF($A2/C$1=INT($A2/C$1),IF(B2=0,1,IF(B2=1,0)),B2)",
815        "safe": true
816    },
817    {
818        "filename": "100 doors_246.txt",
819        "content": "=IF($A3/C$1=INT($A3/C$1),IF(B3=0,1,IF(B3=1,0)),B3)",
820        "safe": true
821    },
822    {
823        "filename": "100 doors_247.txt",
824        "content": "=IF($A2/D$1=INT($A2/D$1),IF(C2=0,1,IF(C2=1,0)),C2)",
825        "safe": true
826    },
827    {
828        "filename": "100 doors_248.txt",
829        "content": "type doorState=Open|Closed\nlet flip=function Open->Closed |_->Open\nlet Doors=Array.create 100 Closed\nfor n in 1..100 do {n-1..n..99}|>Seq.iter(fun n->Doors[n]<-flip Doors[n])\nDoors|>Array.iteri(fun n g->if g=Open then printf \"%d \" (n+1)); printfn \"\"",
830        "safe": true
831    },
832    {
833        "filename": "100 doors_249.txt",
834        "content": "1 4 9 16 25 36 49 64 81 100\n",
835        "safe": true
836    },
837    {
838        "filename": "100 doors_25.txt",
839        "content": "package {                                                                                \n    import flash.display.Sprite;                                              \n\n    public class Doors extends Sprite {\n        public function Doors() {\n\n            // Initialize the array\n            var doors:Array = new Array(100);\n            for (var i:Number = 0; i < 100; i++) {\n                doors[i] = false;\n\n            // Do the work\n            for (var pass:Number = 0; pass < 100; pass++) {\n                for (var j:Number = pass; j < 100; j += (pass+1)) {\n                    doors[j] = !doors[j];\n                }\n            }\n            trace(doors);\n        }\n    }\n}\n",
840        "safe": true
841    },
842    {
843        "filename": "100 doors_250.txt",
844        "content": "open System\nlet answer2 =\n    let PerfectSquare n =\n        let sqrt = int(Math.Sqrt(float n))\n        n = sqrt * sqrt\n    [| for i in 1..100 do yield PerfectSquare i |]",
845        "safe": true
846    },
847    {
848        "filename": "100 doors_251.txt",
849        "content": "[1..100] |> List.fold (fun doors pass->List.mapi (fun i x->if ((i + 1)\u00a0% pass)=0 then not x else x) doors) (List.init 100 (fun _->false))",
850        "safe": true
851    },
852    {
853        "filename": "100 doors_252.txt",
854        "content": "USING: bit-arrays formatting fry kernel math math.ranges\nsequences\u00a0;\nIN: rosetta.doors\n\nCONSTANT: number-of-doors 100\n\n: multiples ( n -- range )\n    0 number-of-doors rot <range>\u00a0;\n\n: toggle-multiples ( n doors -- )\n    [ multiples ] dip '[ _ [ not ] change-nth ] each\u00a0;\n\n: toggle-all-multiples ( doors -- )\n    [ number-of-doors [1,b] ] dip '[ _ toggle-multiples ] each\u00a0;\n\n: print-doors ( doors -- )\n    [\n        swap \"open\" \"closed\"\u00a0? \"Door %d is %s\\n\" printf\n    ] each-index\u00a0;\n\n: main ( -- )\n    number-of-doors 1 + <bit-array>\n    [ toggle-all-multiples ] [ print-doors ] bi\u00a0;\n\nmain",
855        "safe": true
856    },
857    {
858        "filename": "100 doors_253.txt",
859        "content": "USING:\n    formatting\n    math math.primes.factors math.ranges\n    sequences\u00a0;\nIN: rosetta-doors2\n\n: main ( -- )\n    100 [1,b] [ divisors length odd? ] filter \"Open\u00a0%[%d,\u00a0%]\\n\" printf\u00a0;",
860        "safe": true
861    },
862    {
863        "filename": "100 doors_254.txt",
864        "content": "doors = arrayBuffer( 101, false )\n\nfor pass in [ 0\u00a0: doors.len() ]\n  for door in [ 0\u00a0: doors.len()\u00a0: pass+1 ]\n    doors[ door ] = not doors[ door ]\n  end\nend\n\nfor door in [ 1\u00a0: doors.len() ]  // Show Output\n  >  \"Door \", $door, \" is: \", ( doors[ door ] )\u00a0? \"open\"\u00a0: \"closed\"\nend",
865        "safe": true
866    },
867    {
868        "filename": "100 doors_255.txt",
869        "content": "for door in [ 1\u00a0: 101 ]: > \"Door \", $door, \" is: \", fract( door ** 0.5 )\u00a0? \"closed\"\u00a0: \"open\"",
870        "safe": true
871    },
872    {
873        "filename": "100 doors_256.txt",
874        "content": "100[$][0 1\u00f8:1-]#              {initialize doors}\n%\n[s;[$101\\>][$$;~\\:s;+]#%]d:   {function d, switch door state function}\n1s:[s;101\\>][d;!s;1+s:]#      {increment step width from 1 to 100, execute function d each time}\n1[$101\\>][$$.\" \";$[\"open\n\"]?~[\"closed\n\"]?1+]#                       {loop through doors, print door number and state}",
875        "safe": true
876    },
877    {
878        "filename": "100 doors_257.txt",
879        "content": "1 open\n2 closed\n3 closed\n4 open\n5 closed\n6 closed\n7 closed\n8 closed\n9 open\n10 closed\n...\n98 closed\n99 closed\n100 open",
880        "safe": true
881    },
882    {
883        "filename": "100 doors_258.txt",
884        "content": "    states\u00a0:= (1..100).toList\n    100.times |i| {\n      states = states.map |state| { state\u00a0% (i+1) == 0\u00a0? -state\u00a0: +state }\n    }\n    echo(\"Open doors are \" + states.findAll { it < 0 }.map { -it })",
885        "safe": true
886    },
887    {
888        "filename": "100 doors_259.txt",
889        "content": "    echo(\"Open doors are \" + (1..100).toList.findAll { it.toFloat.pow(0.5f).toInt.pow(2) == it})",
890        "safe": true
891    },
892    {
893        "filename": "100 doors_26.txt",
894        "content": "Using #HASH-OFF, OPTION OICC =\"^\" , CICC =\"^\"\n",
895        "safe": true
896    },
897    {
898        "filename": "100 doors_260.txt",
899        "content": "#AppType Console\n\nDim doors[], n As Integer = 100\n\nFor Dim i = 1 To n\n\tFor Dim j = i To n Step i\n\t\tdoors[j] = Not doors[j]\n\tNext\nNext\n\nFor i = 1 To n\n\tIf doors[i] Then Print \"Door \", i, \" is open\"\nNext\n\nPause",
900        "safe": true
901    },
902    {
903        "filename": "100 doors_261.txt",
904        "content": "#APPTYPE CONSOLE\n\nDIM i = 0, j = 0, door = 1\n\nWHILE INCR(i) < 101\n IF i = door THEN\n   PRINT \"Door \", door, \" open\"\n   INCR(door, INCR((INCR(j) << 1)))\n END IF\nWEND\n\nPAUSE",
905        "safe": true
906    },
907    {
908        "filename": "100 doors_262.txt",
909        "content": "; macro for finite loop\n(= repeat (mac (i n . body)\n  (list 'do\n    (list 'let i 0)\n    (list 'while (list '< i n)\n      (list '= i (list '+ i 1))\n      (cons 'do body)))))\n\n; function to get n-th element of list\n(= nth (fn (i lst)\n  (while (< 0 i)\n    (= i (- i 1))\n    (= lst (cdr lst)))\n  lst))\n\n; make list of 100 nils\n(repeat i 100 (= doors (cons nil doors)))\n\n; do algorithm iterations\n(repeat i 100\n  (let pos (nth (- i 1) doors))\n  (while pos\n    (setcar pos (not (car pos)))\n    (= pos (nth i pos))))\n\n(print doors)",
910        "safe": true
911    },
912    {
913        "filename": "100 doors_263.txt",
914        "content": "; do algorithm iterations sqrt(100) = 10 times\n(repeat i 10 (setcar (nth (- (* i i) 1) doors) 't))",
915        "safe": true
916    },
917    {
918        "filename": "100 doors_264.txt",
919        "content": "doors = malloc$ 100u\nfor uint [0u, sizeof$ doors) with l1 {\n  put_byte$ + doors l1 as false byte\n}\nfunction void pass(step:uint) {\n  location = step\n  while <= location sizeof$ doors {\n    ac = - + doors location 1u\n    put_byte$ ac ~ deref_byte$ ac// true is represented as 255 (0xff)\n    location = + location step\n  }\n}\nfor uint (0u, sizeof$ doors] with l2 {//range exclusive of 0, inclusive of 100\n  pass$ l2\n}\ncount = 1u\nfor ubyte as doors listubyte with isopen {// list for-each\n  if as isopen bool {// cast byte to bool\n    puts$ \"door \"\n    putui$ count\n    puts$ \" is open\\n\"\n  }\u00a0;\n  count = + count 1u\n}\nfree$ doors",
920        "safe": true
921    },
922    {
923        "filename": "100 doors_265.txt",
924        "content": "1001-p01.\n>0101-p02.\n>101-g001-g+:::aa*)?v101-p03.\n>02-g?v1}02-p02.    >05.\n      >0}02-p02.\n>~~~0101-p001-g:1+001-paa*)?v02.\n                            >07.\n>0101-p08.\n>101-g::02-g?v     >1+:101-paa*=?;\n             >n\" \"o^",
925        "safe": true
926    },
927    {
928        "filename": "100 doors_266.txt",
929        "content": "1.1 F N=1,100;S D(N)=0\n1.2 F M=1,100;F N=M,M,100;S D(N)=1-D(N)\n1.3 F N=1,100;D 2.0\n1.4 Q\n2.1 I (D(N)),,2.2;R\n2.2 T \"OPEN DOOR \",%3.0,N,!",
930        "safe": true
931    },
932    {
933        "filename": "100 doors_267.txt",
934        "content": "OPEN DOOR =   1\nOPEN DOOR =   4\nOPEN DOOR =   9\nOPEN DOOR =  16\nOPEN DOOR =  25\nOPEN DOOR =  36\nOPEN DOOR =  49\nOPEN DOOR =  64\nOPEN DOOR =  81\nOPEN DOOR = 100",
935        "safe": true
936    },
937    {
938        "filename": "100 doors_268.txt",
939        "content": ": toggle ( c-addr -- )  \\ toggle the byte at c-addr\n    dup c@ 1 xor swap c!\u00a0;\n\n100  1+ ( 1-based indexing ) constant ndoors\ncreate doors  ndoors allot\n\n: init ( -- )  doors ndoors erase\u00a0;  \\ close all doors\n\n: pass ( n -- )  \\ toggle every nth door\n    ndoors over do\n        doors i + toggle\n    dup ( n ) +loop drop\u00a0;\n\n: run ( -- )  ndoors 1 do  i pass  loop\u00a0;\n: display ( -- )  \\ display open doors\n    ndoors 1 do  doors i + c@ if  i .  then loop cr\u00a0;\n\ninit run display",
940        "safe": true
941    },
942    {
943        "filename": "100 doors_269.txt",
944        "content": ": squared ( n -- n' )  dup *\u00a0;\n: doors ( n -- )\n    1 begin 2dup squared >= while\n        dup squared .\n    1+ repeat 2drop\u00a0;\n100 doors",
945        "safe": true
946    },
947    {
948        "filename": "100 doors_27.txt",
949        "content": "VAR sStatus: SHORT\nVAR sArray: SHORT\nVAR sCount: SHORT\nVAR sDoor: SHORT\nVAR sPass: SHORT\nVAR zIndex: STRING\nVAR zState: STRING\n//\nSET sStatus = GET_UNUSED_ARRAY_HANDLE(sArray)\nSET sStatus = INIT_SORTED_ARRAY(sArray, 0, 0, 1)\n//\nDO sCount = 1 TO 100\n  DO sPass = 1 TO 100\n    SET sDoor = sCount * sPass\n    IF sDoor <= 100\n      SET zIndex = REPEAT(\"0\", 3 - LENGTH(STR(sDoor))) + STR(sDoor)\n      SET sStatus = READ_ARRAY_REC(\"=\", sArray, zIndex)\n      SET zState = \"OPEN\"\n      IF GET_STRING_SAY(sArray, 1) = \"OPEN\"\n        SET zState = \"CLOSE\"\n      ENDIF\n      //\n      SET sStatus = ADD_ARRAY_REC(sArray, zIndex)\n      SET sStatus = PUT_STRING_SAY(sArray, 1, zState)\n    ELSE\n      BREAK\n    ENDIF\n  ENDDO\nENDDO\n//\nSET zIndex = \"\"\nSET sStatus = READ_ARRAY_REC(\">=\", sArray, zIndex)\nDO WHILE sStatus = 0\n  >>Door:  ^zIndex^  State: ^GET_STRING_SAY(sArray, 1)^\n  SET sStatus = READ_ARRAY_REC(\"+\", sArray, zIndex)\nENDDO",
950        "safe": true
951    },
952    {
953        "filename": "100 doors_270.txt",
954        "content": "program doors\n    implicit none\n    integer, allocatable\u00a0:: door(:)\n    character(6), parameter\u00a0:: s(0:1) = [character(6)\u00a0:: \"closed\", \"open\"]\n    integer\u00a0:: i, n\n  \n    print \"(A)\", \"Number of doors?\"\n    read *, n\n    allocate (door(n))\n    door = 1\n    do i = 1, n\n        door(i:n:i) = 1 - door(i:n:i)\n        print \"(A,G0,2A)\", \"door \", i, \" is \", s(door(i))\n    end do\nend program",
955        "safe": true
956    },
957    {
958        "filename": "100 doors_271.txt",
959        "content": "PROGRAM DOORS\n\n  INTEGER, PARAMETER\u00a0:: n = 100   \u00a0! Number of doors\n  INTEGER\u00a0:: i\n  LOGICAL\u00a0:: door(n) = .TRUE.     \u00a0! Initially closed\n \n  DO i = 1, SQRT(REAL(n))\n    door(i*i) = .FALSE.\n  END DO  \n \n  DO i = 1, n\n    WRITE(*,\"(A,I3,A)\", ADVANCE=\"NO\") \"Door \", i, \" is \"\n    IF (door(i)) THEN\n      WRITE(*,\"(A)\") \"closed\"\n    ELSE\n      WRITE(*,\"(A)\") \"open\"\n    END IF\n  END DO\n \nEND PROGRAM DOORS",
960        "safe": true
961    },
962    {
963        "filename": "100 doors_272.txt",
964        "content": "program OneHundredIsOpen;\n\nconst\n  DoorCount = 100;\n\nvar\n  IsOpen: array[1..DoorCount] of boolean;\n  Door, Jump: integer;\n\nbegin\n  // Close all doors\n  for Door\u00a0:= 1 to DoorCount do\n    IsOpen[Door]\u00a0:= False;\n  // Iterations\n  for Jump\u00a0:= 1 to DoorCount do\n  begin\n    Door\u00a0:= Jump;\n    repeat\n      IsOpen[Door]\u00a0:= not IsOpen[Door];\n      Door\u00a0:= Door + Jump;\n    until Door > DoorCount;\n  end;\n  // Show final status\n  for Door\u00a0:= 1 to DoorCount do\n  begin\n    Write(Door, ' ');\n    if IsOpen[Door] then\n      WriteLn('open')\n    else\n      WriteLn('closed');\n  end;\n  // Wait for <enter>\n  Readln;\nend.",
965        "safe": true
966    },
967    {
968        "filename": "100 doors_273.txt",
969        "content": "' version 27-10-2016\n' compile with: fbc -s console\n\n#Define max_doors 100\n\nDim As ULong c, n, n1, door(1 To max_doors)\n\n' toggle, at start all doors are closed (0)\n' 0 = door closed, 1 = door open\nFor n = 1 To max_doors\n    For n1 = n To max_doors Step n\n        door(n1) = 1 - door(n1)\n    Next\nNext\n\n' count the doors that are open (1)\nPrint \"doors that are open nr: \";\nFor n = 1 To max_doors\n    If door(n) = 1 Then\n        Print n; \" \";\n        c = c + 1\n    End If\nNext\n\nPrint\u00a0: Print\nPrint \"There are \" + Str(c) + \" doors open\"\n\n' empty keyboard buffer\nWhile InKey <> \"\"\u00a0: Wend\nPrint\u00a0: Print \"hit any key to end program\"\nSleep\nEnd",
970        "safe": true
971    },
972    {
973        "filename": "100 doors_274.txt",
974        "content": "doors that are open nr: 1 4 9 16 25 36 49 64 81 100 \n\nThere are 10 doors open",
975        "safe": true
976    },
977    {
978        "filename": "100 doors_275.txt",
979        "content": "' version 27-10-2016\n' compile with: fbc -s console\n\n#Define max_doors 100\n\nDim As ULong c, n, n1, door(1 To max_doors)\n\n' at start all doors are closed\n' simple add 1 each time we open or close a door\n' doors with odd numbers are open\n' doors with even numbers are closed\nFor n = 1 To max_doors\n    For n1 = n To max_doors Step n\n        door(n1) += 1\n    Next\nNext\n\nPrint \"doors that are open nr: \";\nFor n = 1 To max_doors\n    If door(n) And 1 Then\n        Print n; \" \";\n        c = c + 1\n    End If\nNext\n\nPrint\u00a0: Print\nPrint \"There are \" + Str(c) + \" doors open\"\n\n' empty keyboard buffer\nWhile InKey <> \"\"\u00a0: Wend\nPrint\u00a0: Print \"hit any key to end program\"\nSleep\nEnd",
980        "safe": true
981    },
982    {
983        "filename": "100 doors_276.txt",
984        "content": "' version 27-10-2016\n' compile with: fbc -s console\n\n#Define max_doors 100\n\nDim As ULong c, n\n\nPrint \"doors that are open nr: \";\nFor n = 1 To 10\n    Print n * n; \" \";\n    c = c + 1\nNext\n\nPrint\u00a0: Print\nPrint \"There are \" + Str(c) + \" doors open\"\n\n' empty keyboard buffer\nWhile InKey <> \"\"\u00a0: Wend\nPrint\u00a0: Print \"hit any key to end program\"\nSleep\nEnd",
985        "safe": true
986    },
987    {
988        "filename": "100 doors_277.txt",
989        "content": "' version 16-06-2021\n' portado desde Julia\n\nFor i As Integer = 1 To 10\n    If (i Mod i^2) < 11  Then Print \"La puerta\"; i^2; \" esta abierta\"   \nNext i\nSleep",
990        "safe": true
991    },
992    {
993        "filename": "100 doors_278.txt",
994        "content": "# Set doors to empty list\nset doors\n\n# Initialize doors arrays\nfor i in (seq 100)\n    set doors[$i] 0\nend\n\nfor i in (seq 100)\n    set j $i\n    while test $j -le 100\n        # Logical not on doors\n        set doors[$j] (math\u00a0!$doors[$j])\n        set j (math $j + $i)\n    end\nend\n\n# Print every door\nfor i in (seq (count $doors))\n    echo -n \"$i \"\n    if test $doors[$i] -eq 0\n        echo closed\n    else\n        echo open\n    end\nend",
995        "safe": true
996    },
997    {
998        "filename": "100 doors_279.txt",
999        "content": "# Set doors to empty list\nset doors\n\nfor i in (seq 100)\n    set doors[(math \"$i * $i\")] 1\n    echo -n \"$i \"\n    if test $doors[$i] -eq 1\n        echo open\n    else\n        echo closed\n    end\nend",
1000        "safe": true
1001    },
1002    {
1003        "filename": "100 doors_28.txt",
1004        "content": "Door:  001  State: OPEN\nDoor:  002  State: CLOSE\nDoor:  003  State: CLOSE\nDoor:  004  State: OPEN\nDoor:  005  State: CLOSE\nDoor:  006  State: CLOSE\nDoor:  007  State: CLOSE\nDoor:  008  State: CLOSE\nDoor:  009  State: OPEN\nDoor:  010  State: CLOSE\nDoor:  011  State: CLOSE\nDoor:  012  State: CLOSE\nDoor:  013  State: CLOSE\nDoor:  014  State: CLOSE\nDoor:  015  State: CLOSE\nDoor:  016  State: OPEN\nDoor:  017  State: CLOSE\nDoor:  018  State: CLOSE\nDoor:  019  State: CLOSE\nDoor:  020  State: CLOSE\nDoor:  021  State: CLOSE\nDoor:  022  State: CLOSE\nDoor:  023  State: CLOSE\nDoor:  024  State: CLOSE\nDoor:  025  State: OPEN\nDoor:  026  State: CLOSE\nDoor:  027  State: CLOSE\nDoor:  028  State: CLOSE\nDoor:  029  State: CLOSE\nDoor:  030  State: CLOSE\nDoor:  031  State: CLOSE\nDoor:  032  State: CLOSE\nDoor:  033  State: CLOSE\nDoor:  034  State: CLOSE\nDoor:  035  State: CLOSE\nDoor:  036  State: OPEN\nDoor:  037  State: CLOSE\nDoor:  038  State: CLOSE\nDoor:  039  State: CLOSE\nDoor:  040  State: CLOSE\nDoor:  041  State: CLOSE\nDoor:  042  State: CLOSE\nDoor:  043  State: CLOSE\nDoor:  044  State: CLOSE\nDoor:  045  State: CLOSE\nDoor:  046  State: CLOSE\nDoor:  047  State: CLOSE\nDoor:  048  State: CLOSE\nDoor:  049  State: OPEN\nDoor:  050  State: CLOSE\nDoor:  051  State: CLOSE\nDoor:  052  State: CLOSE\nDoor:  053  State: CLOSE\nDoor:  054  State: CLOSE\nDoor:  055  State: CLOSE\nDoor:  056  State: CLOSE\nDoor:  057  State: CLOSE\nDoor:  058  State: CLOSE\nDoor:  059  State: CLOSE\nDoor:  060  State: CLOSE\nDoor:  061  State: CLOSE\nDoor:  062  State: CLOSE\nDoor:  063  State: CLOSE\nDoor:  064  State: OPEN\nDoor:  065  State: CLOSE\nDoor:  066  State: CLOSE\nDoor:  067  State: CLOSE\nDoor:  068  State: CLOSE\nDoor:  069  State: CLOSE\nDoor:  070  State: CLOSE\nDoor:  071  State: CLOSE\nDoor:  072  State: CLOSE\nDoor:  073  State: CLOSE\nDoor:  074  State: CLOSE\nDoor:  075  State: CLOSE\nDoor:  076  State: CLOSE\nDoor:  077  State: CLOSE\nDoor:  078  State: CLOSE\nDoor:  079  State: CLOSE\nDoor:  080  State: CLOSE\nDoor:  081  State: OPEN\nDoor:  082  State: CLOSE\nDoor:  083  State: CLOSE\nDoor:  084  State: CLOSE\nDoor:  085  State: CLOSE\nDoor:  086  State: CLOSE\nDoor:  087  State: CLOSE\nDoor:  088  State: CLOSE\nDoor:  089  State: CLOSE\nDoor:  090  State: CLOSE\nDoor:  091  State: CLOSE\nDoor:  092  State: CLOSE\nDoor:  093  State: CLOSE\nDoor:  094  State: CLOSE\nDoor:  095  State: CLOSE\nDoor:  096  State: CLOSE\nDoor:  097  State: CLOSE\nDoor:  098  State: CLOSE\nDoor:  099  State: CLOSE\nDoor:  100  State: OPEN\n",
1005        "safe": true
1006    },
1007    {
1008        "filename": "100 doors_280.txt",
1009        "content": "doors = new array[[101], false]\nfor pass=1 to 100\n   for door=pass to 100 step pass\n      doors@door =\u00a0! doors@door\n\nprint[\"Open doors:  \"]\nfor door=1 to 100\n   if doors@door\n      print[\"$door \"]",
1010        "safe": true
1011    },
1012    {
1013        "filename": "100 doors_281.txt",
1014        "content": "define i = 0, d = 0\n\ndo\n\n\tlet i = i + 1\n\tlet d = i * i\n\tprint d\n\nloop d < 100\n\npause\nend",
1015        "safe": true
1016    },
1017    {
1018        "filename": "100 doors_282.txt",
1019        "content": "for i <- 1..100\n  r = foldl1( \\a, b -> a xor b, [(a|i) | a <- 1..100] )\n  println( i + ' ' + (if r then 'open' else 'closed') )",
1020        "safe": true
1021    },
1022    {
1023        "filename": "100 doors_283.txt",
1024        "content": "import math.sqrt\n\nfor i <- 1..100\n  println( i + ' ' + (if sqrt(i) is Integer then 'open' else 'closed') )",
1025        "safe": true
1026    },
1027    {
1028        "filename": "100 doors_284.txt",
1029        "content": "let main(n: i32): [n]bool =\n  loop is_open = replicate n false for i < n do\n    let js = map (*i+1) (iota n)\n    let flips = map (\\j ->\n                       if j < n\n                       then unsafe !is_open[j]\n                       else true -- Doesn't matter.\n                    ) js\n    in scatter is_open js flips",
1030        "safe": true
1031    },
1032    {
1033        "filename": "100 doors_285.txt",
1034        "content": "include \"NSLog.incl\"\n\nNSInteger door, square = 1, increment = 3\n\nfor door = 1 to 100\n  if ( door == square )\n    NSLog( @\"Door %ld is open.\", door )\n    square += increment\u00a0: increment += 2\n  else\n    NSLog( @\"Door %ld is closed.\", door )\n  end if\nnext\n\nHandleEvents",
1035        "safe": true
1036    },
1037    {
1038        "filename": "100 doors_286.txt",
1039        "content": "Door 1 is open.\nDoor 2 is closed.\nDoor 3 is closed.\nDoor 4 is open.\nDoor 5 is closed.\nDoor 6 is closed.\nDoor 7 is closed.\nDoor 8 is closed.\nDoor 9 is open.\nDoor 10 is closed.\nDoor 11 is closed.\nDoor 12 is closed.\nDoor 13 is closed.\nDoor 14 is closed.\nDoor 15 is closed.\nDoor 16 is open.\nDoor 17 is closed.\nDoor 18 is closed.\nDoor 19 is closed.\nDoor 20 is closed.\nDoor 21 is closed.\nDoor 22 is closed.\nDoor 23 is closed.\nDoor 24 is closed.\nDoor 25 is open.\nDoor 26 is closed.\nDoor 27 is closed.\nDoor 28 is closed.\nDoor 29 is closed.\nDoor 30 is closed.\nDoor 31 is closed.\nDoor 32 is closed.\nDoor 33 is closed.\nDoor 34 is closed.\nDoor 35 is closed.\nDoor 36 is open.\nDoor 37 is closed.\nDoor 38 is closed.\nDoor 39 is closed.\nDoor 40 is closed.\nDoor 41 is closed.\nDoor 42 is closed.\nDoor 43 is closed.\nDoor 44 is closed.\nDoor 45 is closed.\nDoor 46 is closed.\nDoor 47 is closed.\nDoor 48 is closed.\nDoor 49 is open.\nDoor 50 is closed.\nDoor 51 is closed.\nDoor 52 is closed.\nDoor 53 is closed.\nDoor 54 is closed.\nDoor 55 is closed.\nDoor 56 is closed.\nDoor 57 is closed.\nDoor 58 is closed.\nDoor 59 is closed.\nDoor 60 is closed.\nDoor 61 is closed.\nDoor 62 is closed.\nDoor 63 is closed.\nDoor 64 is open.\nDoor 65 is closed.\nDoor 66 is closed.\nDoor 67 is closed.\nDoor 68 is closed.\nDoor 69 is closed.\nDoor 70 is closed.\nDoor 71 is closed.\nDoor 72 is closed.\nDoor 73 is closed.\nDoor 74 is closed.\nDoor 75 is closed.\nDoor 76 is closed.\nDoor 77 is closed.\nDoor 78 is closed.\nDoor 79 is closed.\nDoor 80 is closed.\nDoor 81 is open.\nDoor 82 is closed.\nDoor 83 is closed.\nDoor 84 is closed.\nDoor 85 is closed.\nDoor 86 is closed.\nDoor 87 is closed.\nDoor 88 is closed.\nDoor 89 is closed.\nDoor 90 is closed.\nDoor 91 is closed.\nDoor 92 is closed.\nDoor 93 is closed.\nDoor 94 is closed.\nDoor 95 is closed.\nDoor 96 is closed.\nDoor 97 is closed.\nDoor 98 is closed.\nDoor 99 is closed.\nDoor 100 is open.\n",
1040        "safe": true
1041    },
1042    {
1043        "filename": "100 doors_287.txt",
1044        "content": "READ x,y,z\nPRINT \"Open doors: \";x;\" \";\nCYCLE\n    z=x+y\n    PRINT z;\" \";\n    x=z\n    y=y+2\nREPEAT UNTIL z>=100\nDATA 1,3,0\nEND",
1045        "safe": true
1046    },
1047    {
1048        "filename": "100 doors_288.txt",
1049        "content": "Public Sub Main()\nDim bDoor As New Boolean[101]\nDim siCount1, siCount2, siStart As Short\n\nFor siCount1 = 1 To 100\n  Inc siStart\n  For siCount2 = siStart To 100 Step siCount1\n    bDoor[siCount2] = Not bDoor[siCount2]\n  Next\nNext\n\nFor siCount1 = 1 To 100\n  If bDoor[siCount1] Then Print siCount1;;\nNext\n\nEnd",
1050        "safe": true
1051    },
1052    {
1053        "filename": "100 doors_289.txt",
1054        "content": "1 4 9 16 25 36 49 64 81 100\n",
1055        "safe": true
1056    },
1057    {
1058        "filename": "100 doors_29.txt",
1059        "content": "with Ada.Text_Io; use Ada.Text_Io;\n \n procedure Doors is\n    type Door_State is (Closed, Open);\n    type Door_List is array(Positive range 1..100) of Door_State;\n    The_Doors : Door_List := (others => Closed);\n begin\n    for I in 1..100 loop\n       for J in The_Doors'range loop\n          if J mod I = 0 then\n             if The_Doors(J) = Closed then\n                 The_Doors(J) := Open;\n             else\n                The_Doors(J) := Closed;\n             end if;\n          end if;\n       end loop;\n    end loop;\n    for I in The_Doors'range loop\n       Put_Line(Integer'Image(I) & \" is \" & Door_State'Image(The_Doors(I)));\n    end loop;\n end Doors;\n",
1060        "safe": true
1061    },
1062    {
1063        "filename": "100 doors_290.txt",
1064        "content": "doors\u00a0:= function(n)\n  local a,j,s;\n  a\u00a0:= [ ];\n  for j in [1 .. n] do\n    a[j]\u00a0:= 0;\n  od;\n  for s in [1 .. n] do\n    j\u00a0:= s;\n    while j <= n do\n      a[j]\u00a0:= 1 - a[j];\n      j\u00a0:= j + s;\n    od;\n  od;\n  return Filtered([1 .. n], j -> a[j] = 1);\nend;\n\ndoors(100);\n# [ 1, 4, 9, 16, 25, 36, 49, 64, 81, 100 ]",
1065        "safe": true
1066    },
1067    {
1068        "filename": "100 doors_291.txt",
1069        "content": "func Doors(door_count:int) -> void\u00a0:\n  var doors\u00a0: Array\n  doors.resize(door_count)\n\n  # Note\u00a0: Initialization is not necessarily mandatory (by default values are false)\n  # Intentionally left here\n  for i in door_count\u00a0:\n    doors[i] = false\n\n  # do visits\n  for i in door_count\u00a0:\n    for j in range(i,door_count,i+1)\u00a0:\n      doors[j] = not doors[j]\n  \t\n  # print results\n  var results\u00a0: String = \"\"\n  for i in door_count\u00a0:\n    results += str(i+1) + \" \" if doors[i] else \"\"\n  print(\"Doors open\u00a0: %s\"\u00a0% [results] )\n\n# calling the function from the _ready function\nfunc _ready() -> void\u00a0:\n  Doors(100)",
1070        "safe": true
1071    },
1072    {
1073        "filename": "100 doors_292.txt",
1074        "content": "Doors open\u00a0: 1 4 9 16 25 36 49 64 81 100\n",
1075        "safe": true
1076    },
1077    {
1078        "filename": "100 doors_293.txt",
1079        "content": "// 100 doors problem\n// Author: Sinuhe masan (2019)\ninit\n\n\t// 100 elements array of boolean type\n\tdoors:bool[100]\n    \n\tfor var i = 1 to 100\n\t\tdoors[i] = false  // set all doors closed\n    \n    \n\tfor var i = 1 to 100\n\t\tj:int = i\n\t\twhile j <= 100 do\n\t\t\tdoors[j] = not doors[j]\n\t\t\tj = j + i\n    \n\tprint(\"Doors open: \")\n\tfor var i = 1 to 100\n\t\tif doors[i]\n\t\t\tstdout.printf (\"%d \", i)",
1080        "safe": true
1081    },
1082    {
1083        "filename": "100 doors_294.txt",
1084        "content": "100` *=0=>d                      $$ create vector 1..100, create bit pattern d, marking all equal to 0\n:for (1..100[.s]){               $$ loop s from 1 to 100\n  d^(100` %s *=0 )=>d;}          $$ d = d xor (bit pattern of vector 1..100\u00a0% s)\nd                                $$ output d",
1085        "safe": true
1086    },
1087    {
1088        "filename": "100 doors_295.txt",
1089        "content": "Result:\n10010000 10000001 00000000 10000000 00010000 00000000 10000000 00000001 00000000 00000000 10000000 00000000 0001",
1090        "safe": true
1091    },
1092    {
1093        "filename": "100 doors_296.txt",
1094        "content": "var doors,a,i;\n//Sets up the array for all of the doors.\nfor (i = 1; i<=100; i += 1)\n    {\n    doors[i]=0;\n    }\n\n//This first for loop goes through and passes the interval down to the next for loop.\nfor (i = 1; i <= 100; i += 1;)\n    {\n    //This for loop opens or closes the doors and uses the interval(if interval is 2 it only uses every other etc..)\n    for (a = 0; a <= 100; a += i;)\n        {\n        //Opens or closes a door.\n        doors[a] = !doors[a];\n        }\n    }\nopen_doors = '';\n\n//This for loop goes through the array and checks for open doors.\n//If the door is open it adds it to the string then displays the string.\nfor (i = 1; i <= 100; i += 1;)\n    {\n    if (doors[i] == 1)\n        {\n        open_doors += \"Door Number \"+string(i)+\" is open#\";\n        }\n    }\nshow_message(open_doors);\ngame_end();",
1095        "safe": true
1096    },
1097    {
1098        "filename": "100 doors_297.txt",
1099        "content": "package main\n\nimport \"fmt\"\n\nfunc main() {\n    doors\u00a0:= [100]bool{}\n\n    // the 100 passes called for in the task description\n    for pass\u00a0:= 1; pass <= 100; pass++ {\n        for door\u00a0:= pass-1; door < 100; door += pass {\n            doors[door] = !doors[door]\n        }\n    }\n\n    // one more pass to answer the question\n    for i, v\u00a0:= range doors {\n        if v {\n            fmt.Print(\"1\")\n        } else {\n            fmt.Print(\"0\")\n        }\n\n        if i%10 == 9 {\n            fmt.Print(\"\\n\")\n        } else {\n            fmt.Print(\" \")\n        }\n\n    }\n}",
1100        "safe": true
1101    },
1102    {
1103        "filename": "100 doors_298.txt",
1104        "content": "1 0 0 1 0 0 0 0 1 0\n0 0 0 0 0 1 0 0 0 0\n0 0 0 0 1 0 0 0 0 0\n0 0 0 0 0 1 0 0 0 0\n0 0 0 0 0 0 0 0 1 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 1 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n1 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 1\n",
1105        "safe": true
1106    },
1107    {
1108        "filename": "100 doors_299.txt",
1109        "content": "package main\n\nimport \"fmt\"\n\nfunc main() {\n    var door int = 1\n    var incrementer = 0\n\n    for current\u00a0:= 1; current <= 100; current++ {\n        fmt.Printf(\"Door %d \", current)\n\n        if current == door {\n            fmt.Printf(\"Open\\n\")\n            incrementer++\n            door += 2*incrementer + 1\n        } else {\n            fmt.Printf(\"Closed\\n\")\n        }\n    }\n}",
1110        "safe": true
1111    },
1112    {
1113        "filename": "100 doors_3.txt",
1114        "content": "   1   4   9  16  25  36  49  64  81 100",
1115        "safe": true
1116    },
1117    {
1118        "filename": "100 doors_30.txt",
1119        "content": "with Ada.Text_Io; use Ada.Text_Io;\n with Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions;\n \n procedure Doors_Optimized is\n    Num : Float;\n begin\n    for I in 1..100 loop\n       Num := Sqrt(Float(I));\n       Put(Integer'Image(I) & \" is \");\n       if Float'Floor(Num) = Num then\n          Put_Line(\"Opened\");\n       else\n          Put_Line(\"Closed\");\n       end if;\n    end loop;\n end Doors_Optimized;\n",
1120        "safe": true
1121    },
1122    {
1123        "filename": "100 doors_300.txt",
1124        "content": "// 100 (optimized) doors in Go\n\npackage main\n\nimport (\n    \"fmt\"\n    \"math\"\n)\n\nfunc main() {\n    for i\u00a0:= 1; i <= 100; i++ {\n        f\u00a0:= math.Sqrt(float64(i))\n        if math.Mod(f, 1) == 0 {\n            fmt.Print(\"O\")\n        } else {\n            fmt.Print(\"-\")\n        }\n    }\n    fmt.Println()\n}",
1125        "safe": true
1126    },
1127    {
1128        "filename": "100 doors_301.txt",
1129        "content": "O--O----O------O--------O----------O------------O--------------O----------------O------------------O\n",
1130        "safe": true
1131    },
1132    {
1133        "filename": "100 doors_302.txt",
1134        "content": "100:c;[{0}c*]:d;\nc,{.c,>\\)%{.d<\\.d=1^\\)d>++:d;}/}/\n[c,{)\"door \"\\+\" is\"+}%d{{\"open\"}{\"closed\"}if}%]zip\n{\" \"*puts}/",
1135        "safe": true
1136    },
1137    {
1138        "filename": "100 doors_303.txt",
1139        "content": "100,{)}%\n{:d.sqrt 2?=\n{\"open\"}{\"close\"}if\"door \"d+\" is \"+\\+puts}/",
1140        "safe": true
1141    },
1142    {
1143        "filename": "100 doors_304.txt",
1144        "content": "[{\"close\"}100*]:d;\n10,{)2?(.d<\\[\"open\"]\\)d>++:d;}/\n[100,{)\"door \"\\+\" is\"+}%d]zip\n{\" \"*puts}/",
1145        "safe": true
1146    },
1147    {
1148        "filename": "100 doors_305.txt",
1149        "content": "uses java.util.Arrays\n\nvar doors = new boolean[100]\nArrays.fill( doors, false )\n\nfor( pass in 1..100 ) {\n    var counter = pass-1\n    while( counter < 100 ) {\n        doors[counter] = !doors[counter]\n        counter += pass\n  }\n}\n\nfor( door in doors index i ) {\n    print( \"door ${i+1} is ${door\u00a0? 'open'\u00a0: 'closed'}\" )\n}",
1150        "safe": true
1151    },
1152    {
1153        "filename": "100 doors_306.txt",
1154        "content": "var door = 1\nvar delta = 0\n\nfor( i in 1..100 ) {\n    if( i == door ) {\n        print( \"door ${i} is open\" )\n        delta++\n        door += 2*delta + 1\n    } else {\n        print( \"door ${i} is closed\" )\n    }\n}",
1155        "safe": true
1156    },
1157    {
1158        "filename": "100 doors_307.txt",
1159        "content": "doors = [false] * 100\n(0..99).each {\n   it.step(100, it + 1) {\n      doors[it] ^= true\n   }\n}\n(0..99).each {\n   println(\"Door #${it + 1} is ${doors[it]\u00a0? 'open'\u00a0: 'closed'}.\")\n}",
1160        "safe": true
1161    },
1162    {
1163        "filename": "100 doors_308.txt",
1164        "content": "(1..100).each {\n   println(\"Door #${it} is ${Math.sqrt(it).with{it==(int)it}\u00a0? 'open'\u00a0: 'closed'}.\")\n}",
1165        "safe": true
1166    },
1167    {
1168        "filename": "100 doors_309.txt",
1169        "content": "doors = ['closed'] * 100\n(1..10).each { doors[it**2 - 1] = 'open' }\n(0..99).each {\n   println(\"Door #${it + 1} is ${doors[it]}.\")\n}",
1170        "safe": true
1171    },
1172    {
1173        "filename": "100 doors_31.txt",
1174        "content": "# find the first few squares via the unoptimised door flipping method\nscope\n\n    local doorMax\u00a0:= 100;\n    local door;\n    create register door( doorMax );\n\n    # set all doors to closed\n    for i to doorMax do door[ i ]\u00a0:= false od;\n\n    # repeatedly flip the doors\n    for i to doorMax do\n        for j from i to doorMax by i do door[ j ]\u00a0:= not door[ j ] od\n    od;\n\n    # display the results\n    for i to doorMax do if door[ i ] then write( \" \", i ) fi od; print()\n\nepocs",
1175        "safe": true
1176    },
1177    {
1178        "filename": "100 doors_310.txt",
1179        "content": "10 DIM A(100)\n20 FOR OFFSET = 1 TO 100\n30      FOR I = 0 TO 100 STEP OFFSET\n40              A(I) = A(I) + 1\n50      NEXT I\n60 NEXT OFFSET\n70 ' Print \"opened\" doors\n80 FOR I = 1 TO 100\n90      IF A(I) MOD 2 = 1 THEN PRINT I\n100 NEXT I",
1180        "safe": true
1181    },
1182    {
1183        "filename": "100 doors_311.txt",
1184        "content": "1\n4\n9\n16\n25\n36\n49\n64\n81\n100\n",
1185        "safe": true
1186    },
1187    {
1188        "filename": "100 doors_312.txt",
1189        "content": "#define ARRAY_ELEMENTS 100\nPROCEDURE Main()\n   LOCAL aDoors\u00a0:= Array( ARRAY_ELEMENTS )\n   LOCAL i, j\n\n   AFill( aDoors, .F. )\n   FOR i\u00a0:= 1 TO ARRAY_ELEMENTS\n      FOR j\u00a0:= i TO ARRAY_ELEMENTS STEP i\n         aDoors[ j ] =\u00a0! aDoors[ j ]\n      NEXT\n   NEXT\n   AEval( aDoors, {|e, n| QQout( Padl(n,3) + \" is \" + Iif(aDoors[n], \"*open*\", \"closed\" ) + \"|\" ), Iif( n%5 == 0, Qout(), e:=NIL) } )\n   RETURN",
1190        "safe": true
1191    },
1192    {
1193        "filename": "100 doors_313.txt",
1194        "content": "#define ARRAY_ELEMENTS 100\nPROCEDURE Main()\n   LOCAL aDoors\u00a0:= Array( ARRAY_ELEMENTS )\n\n   AFill( aDoors, .F. )\n   AEval( aDoors, {|e, n| aDoors[n]\u00a0:= e\u00a0:= Iif( Int(Sqrt(n))==Sqrt(n), .T., .F. ) } )\n   AEval( aDoors, {|e, n| QQout( Padl(n,3) + \" is \" + Iif(aDoors[n], \"*open*\", \"closed\" ) + \"|\" ), Iif( n%5 == 0, Qout(), e:=NIL )} )\n   RETURN",
1195        "safe": true
1196    },
1197    {
1198        "filename": "100 doors_314.txt",
1199        "content": " 1 is *open*|  2 is closed|  3 is closed|  4 is *open*|  5 is closed| \n 6 is closed|  7 is closed|  8 is closed|  9 is *open*| 10 is closed| \n11 is closed| 12 is closed| 13 is closed| 14 is closed| 15 is closed| \n16 is *open*| 17 is closed| 18 is closed| 19 is closed| 20 is closed| \n21 is closed| 22 is closed| 23 is closed| 24 is closed| 25 is *open*| \n26 is closed| 27 is closed| 28 is closed| 29 is closed| 30 is closed| \n31 is closed| 32 is closed| 33 is closed| 34 is closed| 35 is closed| \n36 is *open*| 37 is closed| 38 is closed| 39 is closed| 40 is closed| \n41 is closed| 42 is closed| 43 is closed| 44 is closed| 45 is closed| \n46 is closed| 47 is closed| 48 is closed| 49 is *open*| 50 is closed| \n51 is closed| 52 is closed| 53 is closed| 54 is closed| 55 is closed| \n56 is closed| 57 is closed| 58 is closed| 59 is closed| 60 is closed| \n61 is closed| 62 is closed| 63 is closed| 64 is *open*| 65 is closed| \n66 is closed| 67 is closed| 68 is closed| 69 is closed| 70 is closed| \n71 is closed| 72 is closed| 73 is closed| 74 is closed| 75 is closed| \n76 is closed| 77 is closed| 78 is closed| 79 is closed| 80 is closed| \n81 is *open*| 82 is closed| 83 is closed| 84 is closed| 85 is closed| \n86 is closed| 87 is closed| 88 is closed| 89 is closed| 90 is closed| \n91 is closed| 92 is closed| 93 is closed| 94 is closed| 95 is closed| \n96 is closed| 97 is closed| 98 is closed| 99 is closed|100 is *open*|\n",
1200        "safe": true

Showing the first 1,200 of 17932 lines. Download the file for the rest.